Departmental Papers (ESE)

Abstract

We present a centralized online (completely reactive) hybrid navigation algorithm for bringing a swarm of n perfectly sensed and actuated point particles in Euclidean d space (for arbitrary n and d) to an arbitrary goal configuration with the guarantee of no collisions along the way. Our construction entails a discrete abstraction of configurations using cluster hierarchies, and relies upon two prior recent constructions: (i) a family of hierarchy-preserving control policies and (ii) an abstract discrete dynamical system for navigating through the space of cluster hierarchies. Here, we relate the (combinatorial) topology of hierarchical clusters to the (continuous) topology of configurations by constructing “portals” — open sets of configurations supporting two adjacent hierarchies. The resulting online sequential composition of hierarchy-invariant swarming followed by discrete selection of a hierarchy “closer” to that of the destination along with its continuous instantiation via an appropriate portal configuration yields a computationally effective construction for the desired navigation policy.

Document Type

Conference Paper

Subject Area

GRASP, Kodlab

Date of this Version

8-2014

Publication Source

2014 International Workshop on the Algorithmic Foundations of Robotics

Comments

For more information: Kod*Lab

Bib Tex

@InProceedings{arslan_guralnik_kod_WAFR2014, Title = {Navigation of Distinct Euclidean Particles via Hierarchical Clustering}, Author = {Omur Arslan and Dan P. Guralnik and Daniel E. Koditschek}, Booktitle = {2014 International Workshop on the Algorithmic Foundations of Robotics (WAFR2014)}, Year = {2014}, Month = {August}, }

Share

COinS
 

Date Posted: 16 February 2015

This document has been peer reviewed.