Multi-Agent Ad Hoc Routing via Trajectory Planning
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Traditional mobile ad hoc network (MANET) routing protocols require a large number of control packets for route discovery and router table maintenance, leading to low packet delivery rates, high routing overhead, and difficulty in meeting the communication requirements of multi-agent systems, especially in scenarios with rapid topological changes and unstable links.
Innovation Solution
A method and device for implementing an ad hoc network routing protocol in a multi-agent system that utilizes collaborative trajectory planning to optimize routing, incorporating a trajectory information acquisition module, data packet delivery module, delivery confirmation module, data packet forwarding module, and data storage module to reduce reliance on control packets and improve communication efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional MANET routing protocols use a large number of control packets for route discovery and router table maintenance, then route reliability is improved, but network overhead and transmission delay increase significantly
Solution Approach 1:
The patent applies preliminary action by pre-planning trajectories for all agents using collaborative trajectory planning algorithms. The routing protocol leverages these pre-computed trajectories to predict future positions and communication links, eliminating the need for frequent route discovery control packets. Agents proactively prepare routing information based on predicted movements, resolving the contradiction between route reliability and network overhead.
Solution Approach 2:
The patent implements dynamics by making the routing protocol adaptive to predicted agent movements. Instead of static routing tables, the system dynamically adjusts routing decisions based on real-time trajectory information and predicted communication links. This dynamic approach maintains route reliability while reducing control packet overhead by only generating routing information when actually needed based on predicted interactions.
2Measurement precision
If frequent route discovery is performed in on-demand routing protocols, then route accuracy is improved, but transmission medium access violations increase and retransmissions occur
Solution Approach 1:
The patent uses preliminary trajectory planning to predict when and where agents will be in communication range of each other. This allows the routing protocol to proactively prepare routing information only when needed, rather than performing frequent periodic route discovery. The predicted trajectories enable accurate route establishment without unnecessary control packet transmissions that cause medium access violations.
Solution Approach 2:
The patent replaces continuous or frequent periodic route discovery with event-driven periodic action based on predicted trajectory intersections. Route discovery is triggered only when trajectory analysis indicates that communication links will be established or broken, eliminating unnecessary periodic control packet transmissions while maintaining route accuracy through timely updates.
3Loss of information
If active routing protocols perform regular routing table maintenance, then routing information freshness is improved, but bandwidth and storage requirements increase
Solution Approach 1:
The patent applies preliminary action by pre-computing trajectories and predicting future communication links before they are needed. This allows the routing protocol to maintain fresh routing information on-demand based on predicted agent interactions, rather than performing regular periodic routing table maintenance. Routing information is generated only when trajectory analysis indicates it will be needed, reducing bandwidth and storage requirements.
Solution Approach 2:
The patent changes the parameter of routing information update frequency from fixed periodic intervals to event-driven timing based on trajectory predictions. This parameter change allows the system to maintain routing information freshness by updating only when predicted agent movements indicate communication link changes, thereby reducing overall bandwidth and storage requirements compared to frequent periodic updates.
4Reliability
If a large number of control packets are used for routing, then route discovery reliability is improved, but computing, communication, storage and energy resources are consumed
Solution Approach 1:
The patent applies preliminary action by pre-planning all agent trajectories using collaborative trajectory planning algorithms before routing operations begin. This preliminary computation enables the routing protocol to predict future communication links and proactively prepare routing information only when needed, eliminating the need for frequent control packet exchanges. The pre-computed trajectory information is reused multiple times, reducing overall resource consumption while maintaining route discovery reliability.
Solution Approach 2:
The patent implements universality by using the pre-computed trajectory information for multiple purposes: collision avoidance, formation maintenance, and routing decision-making. The same trajectory data serves multiple functions, eliminating the need for separate control packet exchanges for routing purposes. This multi-functional use of trajectory information reduces overall resource consumption while maintaining reliable route discovery.
Data Source
AI summary
Disclosed are a method and device for implementing an ad hoc network routing protocol in a multi-agent system. The device includes a trajectory information acquisition module, a data packet delivery module, a delivery confirmation module, a data packet forwarding module, a data transmission feedback module and a data storage module. The method includes: acquiring a separation and rendezvous timing table and an adjacency matrix of an ad hoc network composed of multiple agents at a given moment; if a source node has message sending requirement, performing data packet delivery and delivery confirmation based on the separation and rendezvous timing table and the adjacency matrix; and performing data packet forwarding and transmission status feedback by a non-source node.