Probabilistic. path planning driven by a potential field is a well established technique and has been successfully exploited to solve complex problems arising in a variety of domains. However, planners implementing this approach are rather inefficient in dealing with certain types of local minima occurring in the potential field,. especially those characterized by deep or large attraction basins. In this paper, we present a potential field planner combining "smart," escape motions from local minima with parallel computation to improve overall performance. The results obtained show significant improvement in planning time, along with remarkable reduction in standard deviation. A performance comparison on a benchmark problem of the potential field planner and an existing, state-of-the-art planner is also included. Our investigation confirms the effectiveness of potential field as heuristic to solve difficult path planning problems.

Parallel Path Planning with Multiple Evasion Strategies / Caselli, Stefano; Reggiani, Monica; Sbravati, R.. - 1:(2002), pp. 260-266. ((Intervento presentato al convegno IEEE International Conference on Robotics and Automation (ICRA'02) tenutosi a Washington (DC), USA nel May 11-15, 2002 [10.1109/ROBOT.2002.1013371].

Parallel Path Planning with Multiple Evasion Strategies

CASELLI, Stefano;REGGIANI, Monica;
2002

Abstract

Probabilistic. path planning driven by a potential field is a well established technique and has been successfully exploited to solve complex problems arising in a variety of domains. However, planners implementing this approach are rather inefficient in dealing with certain types of local minima occurring in the potential field,. especially those characterized by deep or large attraction basins. In this paper, we present a potential field planner combining "smart," escape motions from local minima with parallel computation to improve overall performance. The results obtained show significant improvement in planning time, along with remarkable reduction in standard deviation. A performance comparison on a benchmark problem of the potential field planner and an existing, state-of-the-art planner is also included. Our investigation confirms the effectiveness of potential field as heuristic to solve difficult path planning problems.
0780372727
Parallel Path Planning with Multiple Evasion Strategies / Caselli, Stefano; Reggiani, Monica; Sbravati, R.. - 1:(2002), pp. 260-266. ((Intervento presentato al convegno IEEE International Conference on Robotics and Automation (ICRA'02) tenutosi a Washington (DC), USA nel May 11-15, 2002 [10.1109/ROBOT.2002.1013371].
File in questo prodotto:
Non ci sono file associati a questo prodotto.

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: https://hdl.handle.net/11381/1451859
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 13
  • ???jsp.display-item.citation.isi??? 6
social impact