Force-based Algorithm for Motion Planning of Large Agent Teams
원문 초록
This paper presents a distributed, efficient, scalable and real-time motion planning algorithm for a large group of agents moving in 2 or 3-dimensional spaces. This algorithm enables autonomous agents to generate individual trajectories independently with only the relative position information of neighboring agents. Each agent applies a force-based control that contains two main terms: collision avoidance and navigational feedback. The first term keeps two agents separate with a certain distance, while the second term attracts each agent toward its goal location. Compared with existing collision-avoidance algorithms, the proposed force-based motion planning (FMP) algorithm is able to find collision-free motions with lower transition time, free from velocity state information of neighbouring agents. It leads to less computational overhead. The performance of proposed FMP is examined over several dense and complex 2D and 3D benchmark simulation scenarios, with results outperforming existing methods.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
UniConFlow: A Unified Constrained Generalization Framework for Certified Motion Planning with Flow Matching Models
Layered Multirate Control of Constrained Linear Systems
Car Object Counting and Position Estimation via Extension of the CLIP-EBC Framework
Epona: Autoregressive Diffusion World Model for Autonomous Driving
SeqPE: Transformer with Sequential Position Encoding
We Should Identify and Mitigate Third-Party Safety Risks in MCP-Powered Agent Systems
토론
이 논문과 연결된 포럼 글이 아직 없습니다.