用逻辑编程解决城市空中交通避撞问题，效率更高。
Declarative Problem Solving in UAM Strategic Deconfliction
- 用答案集编程（ASP）实现飞行路径与时间同步优化
- 小到中等规模下执行速度比约束规划快，扩展性更好
- 适合需要快速生成安全飞行方案的空管系统
城市空中交通（UAM）需求增长带来空域管理挑战，尤其在人口密集区域。随着无人机、空中出租车和直升机数量上升，空中相撞风险及与现有航路和障碍物冲突加剧。保障安全高效的UAM运行需可靠的策略避撞机制。本文提出一种基于答案集编程（ASP）的策略避撞方法，聚焦飞行计划的时间同步与路径优化。该方法在小到中等规模案例中表现优于约束规划（CP），执行更快、可扩展性更强；而CP虽内存使用稳定，但复杂度上升时性能下降。
原文摘要 · Abstract (English)
The growing demand for Urban Air Mobility (UAM) introduces significant challenges in airspace management, particularly within densely populated metropolitan regions. As the number of aerial vehicles-such as drones, air taxis, and helicopters-continues to rise, so does the risk of mid-air collisions and conflicts with existing air traffic and obstacles. Ensuring safe and efficient UAM operations requires robust strategic deconfliction mechanisms. We propose an Answer Set Programming (ASP) based approach for strategic deconfliction, focusing on time synchronization and route optimization for conflict-free flight plans. The solution is benchmarked against Constraint Programming (CP), emphasizing scalability and resource use. Results show that ASP offers faster execution and better scalability for small to medium cases, while CP maintains stable memory but degrades with complexity.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。