To meet the needs of the guidance of algorithm search in a complex environment, the optimality of global path in a static environment, and the security of real-time obstacle avoidance in a dynamic environment for path planning of cultural and tourism service robots, an algorithm based on the fusion of improved A * algorithm and Dynamic Window Approach is proposed. Firstly, based on the traditional A * algorithm, evaluation function are improved to improve the algorithm's search directionality to a certain extent; Secondly, the concept of safe distance is introduced, and a cubic broken line optimization method is proposed, which eliminates redundant nodes and inflection points, and only retains necessary key path points, greatly reducing the number of inflection points and improving the smoothness of the path. Subsequently, a dynamic obstacle vertical distance cost function was added to the evaluation function of the dynamic window approach to effectively reduce conflicts and collision risks between robots and dynamic obstacles. Finally, the improved A * algorithm is integrated with the dynamic window approach, selecting critical path points as temporary target points for the dynamic window approach. The dynamic window approach is used in segments for local real-time path correction, ensuring the optimal global path and avoiding collisions with unknown obstacles, ultimately achieving a safe and fast destination.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.