Global Path Planning for Mobile Robots with Different Risk Metrics

This work proposes a method to include risk awareness in selecting the global path for a mobile robot moving in an environment shared with humans. We proactively consider prior information on human density distribution in the environment and the potential severity of an encounter in a particular location. We compute a graph considering one path candidate for each possible route in the environment. Each edge has a deterministic cost given by its average length and a stochastic cost that depends on the number of people encountered while the robot moves on it and the severity of each encounter. Then, we plan on the obtained stochastic graph using different coherent risk metrics (Expected Cost, Worst Case, and Conditional Value at Risk), so that the robot can choose the best path according to the risk sensitivity of the specific application scenario.

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2024-10-25
DOI
https://doi.org/10.5281/zenodo.14731094
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Global Path Planning for Mobile Robots with Different Risk Metrics

Zenodo (CERN European Organization for Nuclear Research)
Robotic Path Planning Algorithms
article

Global Path Planning for Mobile Robots with Different Risk Metrics

article en

Abstract

This work proposes a method to include risk awareness in selecting the global path for a mobile robot moving in an environment shared with humans. We proactively consider prior information on human density distribution in the environment and the potential severity of an encounter in a particular location. We compute a graph considering one path candidate for each possible route in the environment. Each edge has a deterministic cost given by its average length and a stochastic cost that depends on the number of people encountered while the robot moves on it and the severity of each encounter. Then, we plan on the obtained stochastic graph using different coherent risk metrics (Expected Cost, Worst Case, and Conditional Value at Risk), so that the robot can choose the best path according to the risk sensitivity of the specific application scenario.

Zenodo (CERN European Organization for Nuclear Research)
Sustainable cities and communities
Openalex Percentile: Top 61%
Robotic Path Planning Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.