Path Planning for Cooperative Aerial Load Transportation in Complex Environments

In this article, a planning algorithm is presented, which is capable to design an overall path in the first stage and determine the formation shape of a cooperative load transportation system forced to move in a spatial hypothetical tunnel (an authorized tunnel), in the second stage. The planning algorithm works in multipassages environment containing obstacles with different shapes and dimensions. The shape of the formation is determined optimally to handle nonconvex constraints like obstacle avoidance, intercollision avoidance between agents and allowable range of cable forces for minimal swing motion. The optimization algorithm also considers the response of the system dynamics and ability of controllers in tracking the optimal path and formation shape. Three types of optimization-based path planning methods are presented called simultaneously all waypoints, waypoint by waypoint (WBW), and waypoints in risk. It is shown that the WBW method presents the best performance in terms of adjustment of the formation shape for passing through narrow passages in complex environment without external or internal collision.

Authors

Institutions

Publication Details

Journal
IEEE Systems Journal
Published
2025-03-22
DOI
https://doi.org/10.1109/jsyst.2025.3547065
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

Path Planning for Cooperative Aerial Load Transportation in Complex Environments

Fariborz Saghafi, Peyman Abeshtan
IEEE Systems Journal
Robotic Path Planning Algorithms
article

Path Planning for Cooperative Aerial Load Transportation in Complex Environments

Fariborz Saghafi, Peyman Abeshtan
article en

Abstract

In this article, a planning algorithm is presented, which is capable to design an overall path in the first stage and determine the formation shape of a cooperative load transportation system forced to move in a spatial hypothetical tunnel (an authorized tunnel), in the second stage. The planning algorithm works in multipassages environment containing obstacles with different shapes and dimensions. The shape of the formation is determined optimally to handle nonconvex constraints like obstacle avoidance, intercollision avoidance between agents and allowable range of cable forces for minimal swing motion. The optimization algorithm also considers the response of the system dynamics and ability of controllers in tracking the optimal path and formation shape. Three types of optimization-based path planning methods are presented called simultaneously all waypoints, waypoint by waypoint (WBW), and waypoints in risk. It is shown that the WBW method presents the best performance in terms of adjustment of the formation shape for passing through narrow passages in complex environment without external or internal collision.

IEEE Systems JournalVol. 19(2)
Sharif University of Technology (IR)
Openalex Percentile: Top 96%
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.

Path Planning for Cooperative Aerial Load Transportation in Complex Environments — Fariborz Saghafi, Peyman Abeshtan · IEEE Systems Journal (2025) | TGRS Research Map | TGRS