Sampling-Based Motion Planning with Preordered Objectives

Motion planning for cyber-physical systems requires addressing numerous system objectives and constraints, including satisfying physical limitations, ensuring safety, reaching goal areas, or reducing energy consumption. Typically, it is only possible to achieve some of the objectives simultaneously since they may contradict. The objectives are usually weighted to specify which plans are preferred in such situations, resulting in a cumbersome tuning process. In this work, we use a weight-free prioritization of the objectives through preorders and introduce a novel sampling-based motion planner designed to efficiently generate trajectories optimizing preordered objectives. We ensure that only the smallest number of required objectives is evaluated to reduce computational time. Our approach can holistically define and solve many types of multi-objective optimization problems, and its usefulness is demonstrated for a Mars rover and an autonomous vehicle.

Authors

Institutions

Publication Details

Published
2025-06-22
DOI
https://doi.org/10.1109/iv64158.2025.11097384
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

Sampling-Based Motion Planning with Preordered Objectives

Matthias Althoff, Patrick Halder
Robotic Path Planning Algorithms
article

Sampling-Based Motion Planning with Preordered Objectives

Matthias Althoff, Patrick Halder
article en

Abstract

Motion planning for cyber-physical systems requires addressing numerous system objectives and constraints, including satisfying physical limitations, ensuring safety, reaching goal areas, or reducing energy consumption. Typically, it is only possible to achieve some of the objectives simultaneously since they may contradict. The objectives are usually weighted to specify which plans are preferred in such situations, resulting in a cumbersome tuning process. In this work, we use a weight-free prioritization of the objectives through preorders and introduce a novel sampling-based motion planner designed to efficiently generate trajectories optimizing preordered objectives. We ensure that only the smallest number of required objectives is evaluated to reduce computational time. Our approach can holistically define and solve many types of multi-objective optimization problems, and its usefulness is demonstrated for a Mars rover and an autonomous vehicle.

ZF Friedrichshafen (Germany) (DE), Technical University of Munich (DE)
Climate action
Openalex Percentile: Top 82%
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.

Sampling-Based Motion Planning with Preordered Objectives — Matthias Althoff, Patrick Halder · (2025) | TGRS Research Map | TGRS