We propose a probability propagation framework for path planning on discrete grids where an agent can navigate in an unknown environment to discover new areas and goals. We introduce a technique in which the probabilistic backward flow provides guidance towards discovering multiple distributed goals and hidden regions. This is achieved using a maximum likelihood path estimation framework in which the hidden areas become constrained goals that “attract” the agent. Simulations on various grids are included in the paper. The results show how this idea, applied to a completely unknown environment and goal position, may provide a unifying and powerful method for distributed dynamic path planning.
Probability propagation for path planning in unknown environments
Buonanno A.;
2025-01-01
Abstract
We propose a probability propagation framework for path planning on discrete grids where an agent can navigate in an unknown environment to discover new areas and goals. We introduce a technique in which the probabilistic backward flow provides guidance towards discovering multiple distributed goals and hidden regions. This is achieved using a maximum likelihood path estimation framework in which the hidden areas become constrained goals that “attract” the agent. Simulations on various grids are included in the paper. The results show how this idea, applied to a completely unknown environment and goal position, may provide a unifying and powerful method for distributed dynamic path planning.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
