Multi-agent multi-objective systems (MAMOS) have emerged as powerful frameworks for modelling complex decision-making problems across various real-world domains, such as robotic exploration, autonomous traffic management, and sensor network optimisation. MAMOS enhances scalability and robustness through decentralised control and more accurately captures inherent trade-offs between conflicting objectives. In MAMOS, each agent uses utility functions that map return vectors to scalar values. Existing MAMOS optimisation methods face significant challenges in handling heterogeneous objective and utility function settings, where training non-stationarity is intensified due to private utility functions and the associated policies. In this paper, we first theoretically prove that direct access to, or structured modeling of, global utility functions is necessary to achieve the Bayesian Nash Equilibrium under decentralised execution constraints. To access the global utility functions while preserving the decentralised execution, we propose an Agent-Attention Multi-Agent Multi-Objective Reinforcement Learning (AA-MAMORL) framework. Our approach implicitly learns a joint belief over other agents’ utility functions and their associated policies during centralised training, effectively mapping global states and utilities to each agent's policy. During execution, each agent independently selects actions based on local observations and its private utility function to approximate a BNE, without relying on inter-agent communication. We evaluate our framework through extensive experiments in a custom-designed MAMO Particle environment and the standard MOMALand benchmark. The results demonstrate that accessibility to global preferences and our proposed AA-MAMORL significantly improves performance and consistently outperforms state-of-the-art methods.

Real-time object detection in disasters facilitates efficient rescue operations and mitigates secondary disasters. Artificial intelligence techniques and remote sensing have recently been widely used in disaster management, especially for vision-related tasks. To counter the need for more annotated data in deep learning-based object detection, we introduce a disaster-specific dataset called DisasterScope containing high-resolution disaster-related imagery. The dataset encompasses a range of images depicting diverse disaster scenarios, enhancing the breadth of training data for improved model performance. Besides, we present an enhanced version of the Real-Time Models for Object Detection (RTMDet) and conduct training and validation on the mentioned dataset. Experimental results demonstrate that the proposed approach outperforms state-of-the-art methods.

Greedy routing efficiently achieves routing solutions for vehicular networks due to its simplicity and reliability. However, the existing greedy routing algorithms have mainly considered simple routing metrics only, e.g., distance based on the local view of an individual vehicle. This consideration is insufficient for analysing dynamic and complicated vehicular communication scenarios which inevitably degrades the overall routing performance. Software-Defined Vehicular Network (SDVN) and Graph Convolutional Network (GCN) can overcome these limitations. Thus, this paper presents a novel GCN-based greedy routing algorithm (NGGRA) in the hybrid SDVN. The SDVN control plane trains the GCN decision model based on the globally collected data. Vehicles with transmission requirements can adopt this model for inferring and making the routing decisions. The proposed node-importance-based graph convolutional network (NiGCN) model analyses multiple correlated metrics to accurately evaluate the dynamic vehicular network is available at:https://github.com/a824899245/NiGCN. Meanwhile, the SDVN architecture offers a global view for model training and routing computation. Extensive simulation results demonstrate that NiGCN outperforms popular GCN models in training efficiency and accuracy. In addition, NGGRA can improve the packet delivery ratio and substantially reduce delay compared with its counterparts.

Temporal information is critical for routing computation in the vehicular network. It plays a vital role in the vehicular network. Till now, most existing routing schemes in vehicular networks consider the networks as a sequence of static graphs. We need to find an appropriate method to process temporal information into routing computation. Thus, in this paper, we propose a routing algorithm based on the Hidden Markov Model (HMM) and temporal graph, namely, Prediction-Based Temporal Graph Routing Algorithm (PT-GROUT). This new algorithm considers the vehicular network as a temporal graph, in which each data transmission as an edge has its specific temporal information. To better capture the temporal information, we select Software-Defined Vehicular Network (SDVN) as our network architecture, which is a preferred architecture for processing the temporal graph regarding the vehicular network since all vehicle statuses can be easily managed. To compute the future routing path accurately and efficiently, the future temporal graph is predicted by applying HMM, in which we model the current vehicular network with dynamic programming and greedy strategies. With the temporal information and reasonable setting of HMM, PT-GROUT can better evaluate the vehicular network and discover the evolution of the internal structure of the network. The optimal routing path can be achieved more efficiently. The simulation results demonstrate that PT-GROUT can substantially improve the computation efficiency and reduce packet loss and delivery delay compared with its counterparts.

In Software Defined Vehicular Networks (SDVNs), most existing studies of routing consider the vehicular network as a static graph and compute the flow table based on static information. However, a static graph could only contain partial network data. Routing computation based on the static graph could be inefficient because vehicular networks are temporal graphs. Thus, in this paper, we propose a novel routing algorithm based on the Markov model and the temporal graph. Unlike conventional routing algorithms, the proposed algorithm adopts the concept of the temporal graph where every edge has its specific temporal information. We apply the Markov model to predict the future routing of the network and adopt prediction data to get the optimal routing by running the temporal graph optimal path algorithm. A benefit of our proposal is, the proposed algorithm searched on the temporal graph of SDVNs can avoid generating additional routing overhead. Besides, based on the information of the vehicular network which is collected from the data plane, the controller can enhance the Markov model as time flows. By applying the above mechanisms, the flow table (route) could be calculated more precisely to enable efficient vehicular communication. The simulation experiments demonstrate the superiority of the proposed algorithm over its counterparts in high-density vehicular networks.