Energy Consumption Minimization for Autonomous Mobile Robot: A Convex Approximation Approach

Abstract

In this paper, we consider a trajectory design problem of an autonomous mobile robot working in industrial environments. In particular, we formulate an optimization problem that jointly determines the trajectory of the robot and the time step duration to minimize the energy consumption without obstacle collisions. We consider both static and moving obstacles scenarios. The optimization problems are nonconvex, and the main contribution of this work proposing successive convex approximation (SCA) algorithms to solve the nonconvex problems with the presence of both static and moving obstacles. In particular, we first consider the optimization problem in the scenario with static obstacles and then consider the optimization problem in the scenario with static and moving obstacles. Then, we propose two SCA algorithms to solve the nonconvex optimization problems in both the scenarios. Simulation results clearly show that the proposed algorithms outperform the A* algorithm, in terms of energy consumption. This shows the effectiveness of the proposed algorithms.

Optimizing an Autonomous Robot’s Path to Increase Movement Speed

“…For example, in the case of robots that intervene in human search and rescue missions, the objective function is determined by the priorities set by the operator [20]. Another objective can be generated if the robot must perform missions that require mapping over large spaces; the criterion can be determined through the management of the energy resource [21]. Otherwise, if the robot has to travel along a route with obstacles, a criterion can be the shortest path between two landmarks (obstacles) [22,23].…”