Intelligent Path Planning for Robotic Systems: Modeling, Optimization and Real-Time Decision-Making

A special issue of Machines (ISSN 2075-1702). This special issue belongs to the section "Robotics, Mechatronics and Intelligent Machines".

Deadline for manuscript submissions: 31 October 2026 | Viewed by 1571

Special Issue Editors


E-Mail Website
Guest Editor
Department of Instrumental & Electrical Engineering, Xiamen University, Xiamen 361005, China
Interests: modeling and simulation, operation optimization, and decision analysis for complex systems including unmanned systems, and power and energy systems
Special Issues, Collections and Topics in MDPI journals

E-Mail Website
Guest Editor
Pen-Tung Sah Institute of Micro-Nano Science and Technology, Xiamen University, Xiamen 361005, China
Interests: robotic dexterous manipulation; audio-visual SLAM; embodied AI in robotic system
Department of Instrumental & Electrical Engineering, Xiamen University, Xiamen 361005, China
Interests: modeling and optimization control for complex systems including unmanned aerial vehicle power systems, ro-bot power systems, and other hybrid power systems
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

Optimization algorithms are pivotal in enabling robots to achieve autonomy in complex, dynamic environments. While traditional methods often fail to address scalability and real-time demands, emerging techniques—from metaheuristics (PSO, GA, ACO) to combinatorial optimization and reinforcement learning—are revolutionizing robotic path planning. However, their practical deployment requires tight integration with environmental perception, robust decision-making under uncertainty, and computationally efficient execution.

This Special Issue focuses on algorithmic innovation and system-level implementation for robotic path planning, emphasizing three interconnected pillars:

(1) Modeling and Optimization

  • Advanced formulations for kinodynamic/dynamic constraints in continuous/discrete spaces;
  • Multi-objective optimization (e.g., energy-time-risk tradeoffs) with interpretability guarantees;
  • Hybrid architectures combining classical optimization with learning-based components.

(2) Real-Time Planning and Decision-Making

  • Online replanning with provable latency bounds (e.g., anytime algorithms, model predictive control);
  • Adaptive strategies for dynamic obstacles and uncertain environments (e.g., stochastic RL, meta-learning);
  • Hardware–algorithm co-design (e.g., edge computing, FPGA acceleration).

(3) Environmental Intelligence for Planning

  • Active perception–modeling–planning loops (e.g., uncertainty-aware mapping);
  • Human-aware navigation (e.g., social cost maps, intent prediction);
  • Physics-informed terrain interaction (e.g., deformable surfaces, fluid dynamics).

We seek contributions that

  • Propose novel algorithms with theoretical rigor and practical validation (simulation + hardware);
  • Address real-world challenges, such as sensor noise, computation/communication bottlenecks, safety-critical constraints;
  • Demonstrate applications in autonomous vehicles, agile robots, search-and-rescue, or other latency-sensitive domains.

Dr. Jingrui Zhang
Dr. Yu Xie
Dr. Po Li
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 250 words) can be sent to the Editorial Office for assessment.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Machines is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2400 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • kinodynamic planning
  • anytime algorithms
  • model predictive control
  • chance-constrained optimization
  • mul-ti-objective optimization
  • subgoal replanning
  • latency-aware scheduling
  • uncertainty-aware mapping
  • human–robot spatial cognition
  • neuromorphic computing for planning
  • physics-informed neural planners
  • federated learn-ing for multi-robot systems
  • bio-inspired navigation
  • heuristic/meta-heuristic path planning

Benefits of Publishing in a Special Issue

  • Ease of navigation: Grouping papers by topic helps scholars navigate broad scope journals more efficiently.
  • Greater discoverability: Special Issues support the reach and impact of scientific research. Articles in Special Issues are more discoverable and cited more frequently.
  • Expansion of research network: Special Issues facilitate connections among authors, fostering scientific collaborations.
  • External promotion: Articles in Special Issues are often promoted through the journal's social media, increasing their visibility.
  • Reprint: MDPI Books provides the opportunity to republish successful Special Issues in book format, both online and in print.

Further information on MDPI's Special Issue policies can be found here.

Published Papers (2 papers)

Order results
Result details
Select all
Export citation of selected articles as:

Research

19 pages, 4477 KB  
Article
ASCON: A Hybrid Path Planning Algorithm for Manipulators in Strongly Constrained Narrow Passages
by Yifei Zhou, Chunyang Liu, Xin Sui, Yan Huang, Nan Guo, Tian Gao, Kunning Ji, Weiwei Zou and Zhixin Zhao
Machines 2026, 14(2), 228; https://doi.org/10.3390/machines14020228 - 15 Feb 2026
Viewed by 458
Abstract
Path planning for high-DOF robotic manipulators in highly constrained environments (e.g., narrow passages) remains challenging due to poor configuration-space (C-space) connectivity, low computational efficiency, and susceptibility to local minima. This paper proposes a hybrid planner, termed ASCON, which couples the directional guidance of [...] Read more.
Path planning for high-DOF robotic manipulators in highly constrained environments (e.g., narrow passages) remains challenging due to poor configuration-space (C-space) connectivity, low computational efficiency, and susceptibility to local minima. This paper proposes a hybrid planner, termed ASCON, which couples the directional guidance of an improved Artificial Potential Field (APF) with the global exploration capability of RRT-Connect to achieve robust planning in non-convex, strongly constrained workspaces. A smoothed potential-field formulation is introduced to suppress oscillations and improve motion smoothness, while a link-radius-based envelope collision-checking strategy is incorporated to ensure safety margins for real deployment. The evaluation is conducted in two benchmark scenarios—dual-layer stacked obstacles and a 100 mm narrow passage—with 50 independent trials per method per scenario; a run is considered successful only if a collision-free feasible path is found within preset iteration/time limits using fixed hyperparameters. Results show that, compared with conventional APF, ASCON reduces average planning time by 66.0%, decreases iteration count by 80.5%, shortens path length by 13.5%, and lowers peak jerk by 40.3%. Physical experiments further validate practical feasibility by guiding a real manipulator through a 100 mm narrow passage in a collision-free manner, demonstrating efficient, smooth, and robust planning under extreme constraints. Full article
Show Figures

Figure 1

30 pages, 9989 KB  
Article
Improved A* Algorithm-Based Optimal Path Planning of Rescue Robots Within Multi-Environment Maps
by Jingrui Zhang, Senpeng Wu, Houde Liu, Xiaojun Zhu and Bin Lan
Machines 2025, 13(12), 1099; https://doi.org/10.3390/machines13121099 - 27 Nov 2025
Cited by 1 | Viewed by 691
Abstract
The traditional A* algorithm performs well in single-map environments, but it is prone to path redundancy and obstacle handling delays in complex multi-map collaborative scenarios, making it unsuitable for the characteristics of multi-environment maps. To address these challenges of traditional A* algorithms, this [...] Read more.
The traditional A* algorithm performs well in single-map environments, but it is prone to path redundancy and obstacle handling delays in complex multi-map collaborative scenarios, making it unsuitable for the characteristics of multi-environment maps. To address these challenges of traditional A* algorithms, this paper proposes a multi-environment map rescue robot path planning method based on an improved A* algorithm. This method introduces an expected cost evaluation function to achieve weighted fusion of path costs and heuristic values from multiple maps, allowing the algorithm to integrate obstacle distributions and weight information across different environments. A random obstacle replacement mechanism is further designed to maintain path feasibility by locally substituting blocked nodes with adjacent accessible nodes, thereby ensuring continuity without global replanning. Through the combination of multi-map information fusion and local obstacle handling, the algorithm generates a globally optimized path that balances planning efficiency, robustness, and adaptability in uncertain rescue scenarios. Experiment results for a 50 × 50 map scenario show that the improved algorithm significantly outperforms single-map planning results in terms of path redundancy, total length, and turning characteristics. The expansion experiments demonstrate that the paths planned by the proposed algorithm are highly consistent with the optimal paths in terms of direction and local deviations, verifying its good feasibility and effectiveness. Full article
Show Figures

Figure 1

Back to TopTop