paper-with-me

Papers

Avoiding Deadlocks Is Not Enough: Analysis and Resolution of Blocked Airplanes

2024-11-25 · Shuhao Qi, Zengjie Zhang, Zhiyong Sun, Sofie Haesaert

This paper is devoted to the analysis and resolution of a pathological phenomenon in airplane encounters called blocking mode. As autonomy in airplane systems increases, a pathological phenomenon can be observed in two-aircraft encounter scenarios, where airplanes stick together and fly in parallel for an extended period. This parallel flight results in a temporary blocking that significantly delays progress. In contrast to widely studied deadlocks in multi-robot systems, such transient blocking is often overlooked in existing literature. Since such prolonged parallel flying places high-speed airplanes at elevated risks of near-miss collisions, encounter conflicts must be resolved as quickly as possible in the context of aviation. We develop a mathematical model for a two-airplane encounter system that replicates this blocking phenomenon. Using this model, we analyze the conditions under which blocking occurs, quantify the duration of the blocking period, and demonstrate that the blocking condition is significantly less restrictive than that of deadlock. Based on these analytical insights, we propose an intention-aware strategy with an adaptive priority mechanism that enables efficient resolution of ongoing blocking phenomena while also incidentally eliminating deadlocks. Notably, the developed strategy does not rely on central coordination and communications that can be unreliable in harsh situations. The analytical findings and the proposed resolution strategy are validated through extensive simulations.

📄 PDF Abstract BibTeX arXiv:2411.16911

Code (0)

등록된 구현이 없습니다.

Tasks

Blocking

Similar Papers 제목 키워드 기반

LLMDR: LLM-Driven Deadlock Detection and Resolution in Multi-Agent Pathfinding

2025-03-02 · Seungbae Seo, Junghwan Kim, Minjeong Shin, Bongwon Suh

Multi-Agent Pathfinding (MAPF) is a core challenge in multi-agent systems. Existing learning-based MAPF methods often struggle with scalability, particularly when addressing complex scenarios that are prone to deadlocks.…

Cooperative-ORCA*: Real-Time Proactive Deadlock Avoidance for Continuous-Space Multi-Agent Navigation

2026-06-22 · Junfeng Wu, Jiaqi Chen, Hongkun Lyu, Kevin Zheng 외 arxiv

Multi-Agent Path Finding (MAPF) is a problem that requires computing collision-free paths for a set of agents from their start locations to designated goal locations. The problem has broad applications in domains where t…

Foundation Models to the Rescue: Deadlock Resolution in Connected Multi-Robot Systems

2024-04-09 · Kunal Garg, Songyuan Zhang, Jacob Arkin, Chuchu Fan

Connected multi-agent robotic systems (MRS) are prone to deadlocks in an obstacle environment where the robots can get stuck away from their desired locations under a smooth low-level control policy. Without an external …

Graph Neural NetworkPrompt Engineering

Virtual Traffic Lights for Multi-Robot Navigation: Decentralized Planning with Centralized Conflict Resolution

2025-11-11 · Sagar Gupta, Thanh Vinh Nguyen, Thieu Long Phan, Vidul Attri 외 arxiv

We present a hybrid multi-robot coordination framework that combines decentralized path planning with centralized conflict resolution. In our approach, each robot autonomously plans its path and shares this information w…

Robot Navigation

A Combination of Theta*, ORCA and Push and Rotate for Multi-agent Navigation

2020-08-03 · Stepan Dergachev, Konstantin Yakovlev, Ryhor Prakapovich

We study the problem of multi-agent navigation in static environments when no centralized controller is present. Each agent is controlled individually and relies on three algorithmic components to achieve its goal while …

Collision Avoidance