Routing a maximum number of disks through a scene of moving obstacles
暂无分享,去创建一个
This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated by applications in air traffic management: aircraft must be routed while avoiding no-fly zones and weather constraints and while maintaining at least a specified horizontal separation distance between themselves. Given a polygonal domain with moving obstacles, our goal is to determine the maximum number of unit disks (aircraft with safety zones) that can be routed safely through the domain, entering/exiting through specified edges of the domain.
The video is meant to accompany the paper [1], which gives details of the algorithm and its analysis.
[1] Esther M. Arkin,et al. Maximum thick paths in static and dynamic environments , 2008, SCG '08.