This work proposes a path planning algorithm for scenarios where the agent has to move strictly inside the space defined by signal emitting bases. Considering a base can emit within a limited area, it is necessary for the agent to be in the vicinity of at least one base at each point along the path in order to receive a signal. The algorithm starts with forming a specific network, based on the starting point such that only the bases which allow the described motion are included. A second step is based on RRT*, where each edge is created solving an optimal control problem that at the end provides a human-like path. Finally the best path is selected among all the ones that reach the goal region with the minimum cost.
Human-like path planning in the presence of landmarks
SAKCAK, BASAK;BASCETTA, LUCA;FERRETTI, GIANNI
2016-01-01
Abstract
This work proposes a path planning algorithm for scenarios where the agent has to move strictly inside the space defined by signal emitting bases. Considering a base can emit within a limited area, it is necessary for the agent to be in the vicinity of at least one base at each point along the path in order to receive a signal. The algorithm starts with forming a specific network, based on the starting point such that only the bases which allow the described motion are included. A second step is based on RRT*, where each edge is created solving an optimal control problem that at the end provides a human-like path. Finally the best path is selected among all the ones that reach the goal region with the minimum cost.File | Dimensione | Formato | |
---|---|---|---|
Humanlike_PP_wLM.pdf
Accesso riservato
Descrizione: articolo principale
:
Post-Print (DRAFT o Author’s Accepted Manuscript-AAM)
Dimensione
550.04 kB
Formato
Adobe PDF
|
550.04 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.