Path planning and obstacle avoidance optimization for delivery robots in complex traffic environments
C.F. Jia, X.J. Tang, P. Zhang
Pages: 91-104
Abstract:
To address the problems of blind sampling
and chassis mechanical wear in modern smart logistics park delivery robots
operating in complex traffic environments, this paper proposes an
edge-cooperative path optimization framework that integrates multi-level
potential field-guided global planning with a spatiotemporal collaborative
local game theory-based improved dynamic window method. First, a local
artificial potential field is used to provide spatial geometric guidance for
the extended tree of the global path search. Combined with fast collision
avoidance detection based on discrete point angles and quadratic B-spline
smoothing, the globally optimal reference path is generated. Second,
multi-dimensional angle threshold conflict judgment and adaptive speed game
strategy are introduced into the local dynamic obstacle avoidance underlying
framework, reconstructing the trajectory evaluation model and endowing the
robot with the ability to accelerate and avoid oncoming high-risk vehicles
and smoothly stop and yield to pedestrians crossing laterally. Results show
that in an extreme congested environment with 50% obstacle density, the
improved global planning algorithm has a single computation time of only 0.95
s. Under a full load of 100 kg, the maximum lateral tracking error is
controlled at 8.5 cm, and the comprehensive energy consumption for a single
full-load delivery is only 25.2 Wh. In dynamic interactive obstacle avoidance
tests, when faced with a sudden lateral pedestrian, the robot's linear velocity
exhibits a smooth U-shaped curve, with an angular velocity adjustment pulse
peak of only 0.25 rad/s. This demonstrates that the research method
effectively eliminates mechanical structure wear caused by high-frequency,
large-angle steering, ensures high real-time performance of underlying
control commands and smooth electrical execution, and provides reliable
theoretical support for the safe operation of heavy-duty park delivery
robots.
Keywords: delivery robot; path planning; artificial
potential field; dynamic window method; spatiotemporal game theory
2026 ISSUES
2025 ISSUES
2024 ISSUES
LXII - April 2024LXIII - July 2024LXIV - November 2024Special 2024 Vol1Special 2024 Vol2Special 2024 Vol3Special 2024 Vol4
2023 ISSUES
LIX - April 2023LX - July 2023LXI - November 2023Special Issue 2023 Vol1Special Issue 2023 Vol2Special Issue 2023 Vol3
2022 ISSUES
LVI - April 2022LVII - July 2022LVIII - November 2022Special Issue 2022 Vol1Special Issue 2022 Vol2Special Issue 2022 Vol3Special Issue 2022 Vol4
2021 ISSUES
LIII - April 2021LIV - July 2021LV - November 2021Special Issue 2021 Vol1Special Issue 2021 Vol2Special Issue 2021 Vol3
2020 ISSUES
2019 ISSUES
Special Issue 2019 Vol1Special Issue 2019 Vol2Special Issue 2019 Vol3XLIX - November 2019XLVII - April 2019XLVIII - July 2019
2018 ISSUES
Special Issue 2018 Vol1Special Issue 2018 Vol2Special Issue 2018 Vol3XLIV - April 2018XLV - July 2018XLVI - November 2018
2017 ISSUES
Special Issue 2017 Vol1Special Issue 2017 Vol2Special Issue 2017 Vol3XLI - April 2017XLII - July 2017XLIII - November 2017
2016 ISSUES
Special Issue 2016 Vol1Special Issue 2016 Vol2Special Issue 2016 Vol3XL - November 2016XXXIX - July 2016XXXVIII - April 2016
2015 ISSUES
Special Issue 2015 Vol1Special Issue 2015 Vol2XXXV - April 2015XXXVI - July 2015XXXVII - November 2015
2014 ISSUES
Special Issue 2014 Vol1Special Issue 2014 Vol2Special Issue 2014 Vol3XXXII - April 2014XXXIII - July 2014XXXIV - November 2014
2013 ISSUES
2012 ISSUES
2011 ISSUES
2010 ISSUES
2009 ISSUES
2008 ISSUES
2007 ISSUES
2006 ISSUES
2005 ISSUES
2004 ISSUES
2003 ISSUES
