A model predictive obstacle avoidance method based on dynamic motion primitives and a Kalman filter

Abstract

A dynamic motion primitive (DMP) is a robust framework that generates obstacle avoidance trajectories by introducing perturbative terms. The perturbative term is usually constructed with an artificial potential field (APF) method.Dynamic obstacle avoidance is rarely considered with this approach; furthermore, even when dynamic obstacles are considered, only the velocity and position information of the current state are incorporated into the obstacle avoidance framework. However, if the position of an obstacle changes suddenly, a robot may be placed in a dangerous position close to the obstacle, resulting in large obstacle avoidance accelerations, sharp trajectories, or even obstacle avoidance failure. Therefore, we present a model predictive obstacle avoidance method based on dynamic motion primitives and a Kalman filter. This method has three main components: Dynamic motion primitives are used to generate the desired trajectory and introduce perturbations to achieve obstacle avoidance; the Kalman filter method is adopted to estimate the future positions of the obstacles; and model predictive control is employed to optimize the repulsive force generated by the APF while minimizing the defined cost function, thus guaranteeing the safety and flexibility of the method. We validate the presented method with 2D and 3D obstacle avoidance simulations. The method is also verified with a real robot: the-Kinova MOVO. The simulation and experimental results show that the proposed method not only avoids dynamic obstacles but also tracks the desired trajectory more smoothly and precisely. KEYWORDS artificial potential field (APF), dynamic motion primitive (DMP), dynamic obstacle avoidance, kalman filter, model predictive control (MPC)

Sequential fusion estimation for multisensor multirate systems with measurement outliers

“…State fusion estimation is one of the most basic information fusion techniques and has always been a hot topic in recent years, which fuses the results of local estimation to obtain more accurate and comprehensive state information [1]. Up to now, many recursive filtering algorithms have been designed according to the actual requirement for state estimation, which include the classical Kalman filter (KF) [2,3], extended Kalman filter (EKF) [4], unscented Kalman filter (UKF) [5], and Tobit Kalman filter (TKF) [6].…”

Optimal coordination in logistics warehousing with sensing and communication limits: A distributed differential game approach

“…With the development of industry and the increased level of automation, automated guided vehicles (AGVs), as core components of advanced logistics systems, have become popular in modern industrial logistics systems [1], due to their ability to reduce logistics transportation time, shorten the production cycle, and improve overall efficiency for the production line [2]. Recent studies reveal that an effective coordination policy, which considers objectives including efficient utilization of all AGV subsystems, respecting temporal and spatial constraints, and avoiding collisions, subject to sensing and communication limits, and changing environments, is essential in achieving the maximum transportation efficiency of the entire logistic warehousing system [3]. A logistic warehousing system, consisting of multiple AGV agents, performing their specified transportation tasks, that is, minimizing individual task completion time and avoiding collisions with local obstacles and nearby AGVs, might result in the global (system-level) planning problem optimizing conflicting objectives [4,5].…”

Adaptive path planning and tracking system based on model predictive control for autonomous vehicle local obstacle avoidance

“…The results show that the generated obstacle avoidance paths are all within reasonable constraints. A lane association MPC path planning method for autonomous vehicles is proposed by Zuo et al [18,19], which combines MPC with APF and treats time-varying safety constraints as a repulsive range of action to reduce the number of constraints for optimization and improve the computational speed. Chen et al [20] establish a pedestrian constraint potential field by predicting the dynamic trajectory of pedestrians and design a dynamic pedestrian avoidance planning tracking system based on MPC, which can effectively achieve pedestrian protection.…”