Path Planning of a Mobile Delivery Robot Operating in a Multi-Story Building Based on a Predefined Navigation Tree

Abstract

Planning the path of a mobile robot that must transport and deliver small packages inside a multi-story building is a problem that requires a combination of spatial and operational information, such as the location of origin and destination points and how to interact with elevators. This paper presents a solution to this problem, which has been formulated under the following assumptions: (1) the map of the building’s floors is available; (2) the position of all origin and destination points is known; (3) the mobile robot has sensors to self-localize on the floors; (4) the building is equipped with remotely controlled elevators; and (5) all doors expected in a delivery route will be open. We start by defining a static navigation tree describing the weighted paths in a multi-story building. We then proceed to describe how this navigation tree can be used to plan the route of a mobile robot and estimate the total length of any delivery route using Dijkstra’s algorithm. Finally, we show simulated routing results that demonstrate the effectiveness of this proposal when applied to an autonomous delivery robot operating in a multi-story building.

Keywords

• mobile robot
• path planning
• Dijkstra’s algorithm
• package delivery
• multi-story building