<?xml version="1.0"?>
<metadata xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/"><dc:title>Optimizing obstacle avoidance path planning for intelligent mobile robots in multi-obstacle environments</dc:title><dc:creator>Zhang,	H. Q.	(Avtor)
	</dc:creator><dc:subject>intelligent mobile robots</dc:subject><dc:subject>obstacle avoidance path planning</dc:subject><dc:subject>adaptive Monte Carlo</dc:subject><dc:subject>envelope method</dc:subject><dc:description>To enhance the obstacle avoidance capabilities of intelligent mobile robots in environments with multiple obstacles, a method for optimal path planning has been developed and analysed. Multi-obstacle scene maps were generated using the safety boundary condition method and envelope method, with obstacle distribution abstractly represented by an obstacle rate. The robot's pose and orientation were determined through the application of Adaptive Monte Carlo localization. Speed sampling was conducted to identify the optimal speed combination, establishing a set of candidate trajectories. A trajectory evaluation function was constructed, and the trajectory with the highest score was selected. The improved A* algorithm was integrated into the evaluation function, incorporating the obstacle rate to refine path planning. To eliminate redundant sections, a key point extraction algorithm was employed to adjust and smooth the path, ensuring optimal obstacle avoidance. The proposed approach demonstrated superior performance, achieving a shorter planned path, a rapid obstacle avoidance reaction time of 32 milliseconds, a 100 % success rate in obstacle avoidance, and a path smoothness of 97 %. These results indicate that the method is highly effective for obstacle avoidance, with significant improvements in both safety and efficiency.</dc:description><dc:publisher>Chair of Production Engineering (CPE), University of Maribor Faculty of Mechanical Engineering</dc:publisher><dc:date>2024</dc:date><dc:date>2026-02-03 08:50:06</dc:date><dc:type>Članek v reviji</dc:type><dc:identifier>96928</dc:identifier><dc:identifier>UDK: 658.5:685.5</dc:identifier><dc:identifier>COBISS_ID: 267049475</dc:identifier><dc:identifier>DOI: 10.14743/apem2024.3.512</dc:identifier><dc:identifier>ISSN pri članku: 1854-6250</dc:identifier><dc:language>sl</dc:language><dc:rights>Content from this work may be used under the terms of the Creative Commons Attribution 4.0 International Licence (CC BY 4.0). Any further distribution of this work must maintain attribution to the author(s) and the title of the work, journal citation and DOI. </dc:rights></metadata>
