Journal Article

Model-Based Global Path Planning for Mobile Robots with Different Kinematic Structures Under Path Length and Energy Efficiency Criteria: A Case Study

Trojnacki, Maciej, Agakpe, Gabriel

2026

Overview

This paper addresses global path planning for a wheeled mobile robot with two different kinematic structures, considering both shortest path and minimum energy consumption criteria. The main research question concerns how the robot’s kinematic structure and the selected planning algorithm influence the resulting path with respect to these criteria. Our review of the state of the art discusses selected path planning methods, including model-based approaches. To determine the energy optimal path, a simplified model of the PIAP GRANITE robot was developed. The robot can be configured as either differentially driven or skid-steered. In the differentially driven configuration, the robot has two driven wheels and two caster wheels, whereas in the skid-steered configuration all wheels are independently driven. The robot’s models are based on previous theoretical and experimental studies and include kinematics, dynamics, drive units, and wheel slip phenomena. For path planning, it was assumed that the robot can move straight or turn. A flat terrain representative of typical urban environments was modeled as a grid of square cells, each characterized by friction and rolling resistance coefficients. Path planning was performed using A*, Theta*, and RRT* algorithms. In order to quantitatively evaluate the results, quality indexes were defined, including path length, energy consumption, computation time, and the number of analyzed nodes. Simulation results are presented for selected terrain maps, both robot configurations, all algorithms, and both optimization criteria. The results show that the differentially driven configuration is consistently more energy-efficient. For the skid-steered robot, minimizing the number of turns is crucial due to high turning energy costs. The A* algorithm consistently finds optimal paths, whereas RRT* is faster but produces non-optimal and non-repeatable results. Theta* does not always achieve optimality due to limitations imposed by the line-of-sight function.

• Publisher: MDPI AG
• Subject: Algorithms / Configurations / Criteria / Energy consumption / Energy costs / Energy efficiency / Kinematics / Line of sight / Methods / Optimization / Partial differential equations / Planning / Robot dynamics / Robotics / Robots / Rolling resistance / Shortest-path problems / Simulation / Terrain mapping / Urban environments / Wheels