Research on the optimum path Taking the hospital delivery robot as an example

Abstract

Medical delivery robot refers to the delivery robot used in the medical field. Compared with ordinary delivery robots, the medical delivery robot needs to work in an environment with many people, which means that it needs to deal with many random obstacles at any time. This article will discuss automatically avoiding obstacles, and formulate and compare algorithms to analyze the advantages and disadvantages of automatic road exploration algorithms of different algorithms. In order to accomplish this goal, this paper will use Matlab as the main development tool and use the A-star algorithm and the Euclid algorithm as the main heuristics in the main mathematical model of the program. This program needs to be able to complete the obstacle avoidance task in a map with random size, random position, random shape, and random number of obstacles, and be able to reach the end point from the starting point. In addition, this paper will also discuss the efficiency of the A-star algorithm and the Dijkstra algorithm in obstacle avoidance and route planning, and demonstrate why the A-star algorithm is more efficient by taking time and congestion indicators.