We show how using anytime algorithms for solving the multiple robots motion planning problem allows to evaluate the opportunity of looking for alternative solution paths by generating small variations of robot motions in space and in time. By using the concept of plan robustness, we generate several alternative paths that are evaluated through various Performance Indices and Impact Factors, that allow to know how much a variation affects a given plan. Finally, we outline some recent experiments.

Varying paths and motion profiles in multiple robot motion planning

FERRARI, CARLO;PAGELLO, ENRICO;
1997

Abstract

We show how using anytime algorithms for solving the multiple robots motion planning problem allows to evaluate the opportunity of looking for alternative solution paths by generating small variations of robot motions in space and in time. By using the concept of plan robustness, we generate several alternative paths that are evaluated through various Performance Indices and Impact Factors, that allow to know how much a variation affects a given plan. Finally, we outline some recent experiments.
Proceedings 1997 IEEE International Symposium on Computational Intelligence in Robotics and Automation CIRA'97.
0818681381
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

Caricamento pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11577/2534894
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? 3
social impact