Navigation of Distinct Euclidean Particles via Hierarchical Clustering

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.

[1]  Hyo-Sung Ahn,et al.  Formation control of quad-rotors in three dimension based on euclidean distance dynamics matrix , 2011, 2011 11th International Conference on Control, Automation and Systems.

[2]  N. G. Parke,et al.  Ordinary Differential Equations. , 1958 .

[3]  Paul G. Spirakis,et al.  Strong NP-Hardness of Moving Many Discs , 1984, Inf. Process. Lett..

[4]  อนิรุธ สืบสิงห์,et al.  Data Mining Practical Machine Learning Tools and Techniques , 2014 .

[5]  Yunhui Liu,et al.  A new solid model HSM and its application to interference detection between moving objects , 1991, J. Field Robotics.

[6]  E. Fadell,et al.  Geometry and Topology of Configuration Spaces , 2000 .

[7]  Daniel E. Koditschek,et al.  Automatic assembly planning and control via potential functions , 1991, Proceedings IROS '91:IEEE/RSJ International Workshop on Intelligent Robots and Systems '91.

[8]  Daniel E. Koditschek.  Some Applications of Natural Motion Control , 1991 .

[9]  Dan Halperin,et al.  k-color multi-robot motion planning , 2012, Int. J. Robotics Res..

[10]  R. Ho.  Algebraic Topology , 2022 .

[11]  Daniel E. Koditschek,et al.  Toward the automatic control of robot assembly tasks via potential functions: the case of 2-D sphere assemblies , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[12]  Daniel E. Koditschek,et al.  Exact robot navigation using artificial potential functions , 1992, IEEE Trans. Robotics Autom..

[13]  Louis J. Billera,et al.  Geometry of the Space of Phylogenetic Trees , 2001, Adv. Appl. Math..

[14]  Hyo-Sung Ahn,et al.  Distance-based formation control using euclidean distance dynamics matrix: Three-agent case , 2011, Proceedings of the 2011 American Control Conference.

[15]  Sergio M. Savaresi,et al.  On the performance of bisecting K-means and PDDP , 2001, SDM.

[16]  Vijay Kumar,et al.  Synthesis of Controllers to Create, Maintain, and Reconfigure Robot Formations with Communication Constraints , 2009, ISRR.

[17]  Herbert G. Tanner,et al.  Multiagent Navigation Functions Revisited , 2012, IEEE Transactions on Robotics.

[18]  Dimos V. Dimarogonas,et al.  A feedback stabilization and collision avoidance scheme for multiple independent non-point agents, , 2006, Autom..

[19]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[20]  Yunhui Liu,et al.  A practical algorithm for planning collision-free coordinated motion of multiple mobile robots , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[21]  Ronald L. Rivest,et al.  Introduction to Algorithms, third edition , 2009 .

[22]  Boris Mirkin,et al.  Mathematical Classification and Clustering , 1996 .

[23]  Yuliy Baryshnikov,et al.  Min-type Morse theory for configuration spaces of hard spheres , 2011, ArXiv.

[24]  Daniel E. Koditschek,et al.  Hierarchically clustered navigation of distinct Euclidean particles , 2012, 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[25]  D. Robinson.  Comparison of labeled trees with valency three , 1971 .

[26]  V. Arnold,et al.  Ordinary Differential Equations , 1973 .

[27]  B. Dasgupta,et al.  On distances between phylogenetic trees , 1997, SODA '97.

[28]  G. Moore,et al.  An iterative approach from the standpoint of the additive hypothesis to the dendrogram problem posed by molecular data sets. , 1973, Journal of theoretical biology.

[29]  Russell H. Taylor,et al.  Automatic Synthesis of Fine-Motion Strategies for Robots , 1984 .

[30]  Daniel E. Koditschek,et al.  Adaptive Techniques for Mechanical Systems , 1987 .

[31]  Daniel E. Koditschek,et al.  Sequential Composition of Dynamically Dexterous Robot Behaviors , 1999, Int. J. Robotics Res..

[32]  Libor Preucil,et al.  European Robotics Symposium 2008 , 2008 .

[33]  Mark de Berg,et al.  Efficient Multi-Robot Motion Planning for Unlabeled Discs in Simple Polygons , 2013, IEEE Transactions on Automation Science and Engineering.

[34]  Anil K. Jain,et al.  Algorithms for Clustering Data , 1988 .

[35]  Vijay Kumar,et al.  Concurrent assignment and planning of trajectories for large teams of interchangeable robots , 2013, 2013 IEEE International Conference on Robotics and Automation.