— The E∗ algorithm is a path planning method capable of dynamic replanning and user-configurable path cost interpolation. It calculates a navigation function as a sampling of ...
— This paper presents work on sensor-based motion planning in initially unknown dynamic environments. Motion detection and modeling are combined with a smooth navigation function...
We present a demonstration of a multi-agent prototype for distributed planning and coordination in dynamic non-deterministic multi-actor mixed-initiative environments. The system ...
— We present a sampling-based path planning and replanning algorithm that produces anytime solutions. Our algorithm tunes the quality of its result based on available search time...
This paper describes an integrated system for coordinating multiple rover behavior with the overall goal of collecting planetary surface data. The MISUS system combines techniques...
Tara A. Estlin, Daniel M. Gaines, Forest Fisher, R...