An application-based characterization of dynamical distance geometry problems

The dynamical distance geometry problem (dynDGP) is the problem of finding a realization in a Euclidean space of a weighted undirected graph G representing an animation by relative distances, so that the distances between realized vertices are as close as possible to the edge weights. In the dynDGP, the vertex set of the graph G is the set product of V , representing certain objects, and T , representing time as a sequence of discrete steps. We suppose moreover that distance information is given together with the priority of every distance value. The dynDGP is a special class of the DGP where the dynamics of the problem comes to play an important role. In this work, we propose an application-based characterization of dynDGP instances, where the main criteria are the presence or absence of a skeletal structure, and the rigidity of such a skeletal structure. Examples of considered applications include: multi-robot coordination, crowd simulations, and human motion retargeting.

[1]  Mac Schwager,et al.  Vision-Based Distributed Formation Control Without an External Positioning System , 2016, IEEE Transactions on Robotics.

[2]  Antonio Mucherino,et al.  An Approach to Dynamical Distance Geometry , 2017, GSI.

[3]  Bill Jackson,et al.  Egerváry Research Group on Combinatorial Optimization Connected Rigidity Matroids and Unique Realizations of Graphs Connected Rigidity Matroids and Unique Realizations of Graphs , 2022 .

[4]  Marcos Raydan,et al.  Molecular conformations from distance matrices , 1993, J. Comput. Chem..

[5]  Chris Hecker,et al.  Real-time motion retargeting to highly varied user-created morphologies , 2008, SIGGRAPH 2008.

[6]  Nathan Krislock,et al.  Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions , 2010, SIAM J. Optim..

[7]  Franck Multon,et al.  MKM: A Global Framework for Animating Humans in Virtual Reality Applications , 2008, PRESENCE: Teleoperators and Virtual Environments.

[8]  Jérémy Omer,et al.  A space-discretized mixed-integer linear model for air-conflict resolution with speed and heading maneuvers , 2014, Comput. Oper. Res..

[9]  Antonio Franchi,et al.  A rigidity-based decentralized bearing formation controller for groups of quadrotor UAVs , 2016, 2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).

[10]  Jan de Leeuw,et al.  Differentiability of Kruskal's stress at a local minimum , 1984 .

[11]  Leo Liberti,et al.  Distance Geometry: Theory, Methods, and Applications , 2013, Distance Geometry.

[12]  Antonio Franchi,et al.  Decentralized rigidity maintenance control with range measurements for multi-robot systems , 2013, Int. J. Robotics Res..

[13]  Franck Multon,et al.  Normalized Euclidean distance matrices for human motion retargeting , 2017, MIG.

[14]  Franck Multon,et al.  A distance-based approach for human posture simulations , 2017, 2017 Federated Conference on Computer Science and Information Systems (FedCSIS).

[15]  Franck Multon,et al.  Computer Animation of Human Walking: a Survey , 1999 .

[16]  Leo Liberti,et al.  A Branch-and-Prune algorithm for the Molecular Distance Geometry Problem , 2008, Int. Trans. Oper. Res..

[17]  Antonio Mucherino,et al.  Distance Geometry and Applications , 2015 .

[18]  David C. Brogan,et al.  Animating human athletics , 1995, SIGGRAPH.

[19]  J. Pettré,et al.  Minimal predicted distance: a common metric for collision avoidance during pairwise interactions between walkers. , 2012, Gait & posture.

[20]  G. Laman.  On graphs and rigidity of plane skeletal structures , 1970 .

[21]  William W. Hager,et al.  A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization , 2004, SIAM J. Optim..

[22]  D. Fox,et al.  Distributed Multirobot Exploration and Mapping Robots exploring an indoor environment can exchange position and orientation data to locate themselves in shared maps, then meet at common locations to verify that the maps are correct. , 2006 .

[23]  Michael Gleicher,et al.  Retargetting motion to new characters , 1998, SIGGRAPH.

[24]  Jonathan P. How,et al.  Aircraft trajectory planning with collision avoidance using mixed integer linear programming , 2002, Proceedings of the 2002 American Control Conference (IEEE Cat. No.CH37301).

[25]  Leo Liberti,et al.  The discretizable molecular distance geometry problem , 2006, Computational Optimization and Applications.

[26]  Dirk Helbing,et al.  Simulating dynamical features of escape panic , 2000, Nature.

[27]  José Mario Martínez,et al.  Nonmonotone Spectral Projected Gradient Methods on Convex Sets , 1999, SIAM J. Optim..

[28]  Leo Liberti,et al.  The interval Branch-and-Prune algorithm for the discretizable molecular distance geometry problem with inexact distances , 2011, Journal of Global Optimization.

[29]  Leo Liberti,et al.  Euclidean Distance Geometry and Applications , 2012, SIAM Rev..

[30]  José Mario Martínez,et al.  Large-Scale Active-Set Box-Constrained Optimization Method with Spectral Projected Gradients , 2002, Comput. Optim. Appl..

[31]  Leo Liberti,et al.  Molecular distance geometry methods: from continuous to discrete , 2010, Int. Trans. Oper. Res..

[32]  J. Kruskal.  Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis , 1964 .