An application-based characterization of dynamical distance geometry problems - Archive ouverte HAL Access content directly
Journal Articles Optimization Letters Year : 2020

An application-based characterization of dynamical distance geometry problems

(1) , (2, 3) , (1) , (4) , (1, 5)
1
2
3
4
5

Abstract

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.
Fichier principal
Vignette du fichier
dynDGP-applications (1).pdf (435.94 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01846265 , version 1 (25-09-2018)

Identifiers

Cite

Antonio Mucherino, Jérémy Omer, Ludovic Hoyet, Paolo Robuffo Giordano, Franck Multon. An application-based characterization of dynamical distance geometry problems. Optimization Letters, 2020, 14 (2), pp.493-507. ⟨10.1007/s11590-018-1302-6⟩. ⟨hal-01846265⟩
411 View
163 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More