A Decentralized Kernel Density Estimation Approach to Distributed Robot Path Planning

This paper presents a decentralized kernel density estimation (KDE) technique for computing the actual positional density of the robots in a distributed network, which constitutes the feedback in the robot’s control law. The goal of the feedback control law is to plan the paths of a distributed robot network in order to follow a known, optimal time-varying robot distribution or probability density function (PDF). Thus, knowledge of the actual positional density of the robots is needed to compute the robot feedback control law, such that the optimal PDF is achieved over time by the network. The optimal PDF is computed using a distributed optimal control (DOC) approach that guarantees the robots avoid collisions with obstacles, while minimizing the energy required to meet a goal distribution. This novel approach generates a potential function, and corresponding control law, for each robot through the decentralized computation of the robots’ probability density function (PDF) obtained from the individual states of the robots. The methodology is demonstrated through a numerical simulation of a large distributed network of robots navigating an obstacle-populated region of interest.

[1]  C. W. Gear,et al.  Equation-Free, Coarse-Grained Multiscale Computation: Enabling Mocroscopic Simulators to Perform System-Level Analysis , 2003 .

[2]  Hua Chen,et al.  Distributed Density Estimation Using Non-parametric Statistics , 2007, 27th International Conference on Distributed Computing Systems (ICDCS '07).

[3]  D. W. Scott,et al.  Multivariate Density Estimation, Theory, Practice and Visualization , 1992 .

[4]  G. Swaminathan.  Robot Motion Planning , 2006 .

[5]  Silvia Ferrari,et al.  A probability density function approach to distributed sensors' path planning , 2010, 2010 IEEE International Conference on Robotics and Automation.

[6]  Jean-Claude Latombe,et al.  Numerical potential field techniques for robot path planning , 1991, Fifth International Conference on Advanced Robotics 'Robots in Unstructured Environments.

[7]  Dongbing Gu,et al.  Distributed EM Algorithm for Gaussian Mixtures in Sensor Networks , 2008, IEEE Transactions on Neural Networks.

[8]  Shuzhi Sam Ge,et al.  New potential functions for mobile robot path planning , 2000, IEEE Trans. Robotics Autom..

[9]  Robert D. Nowak,et al.  Distributed EM algorithms for density estimation and clustering in sensor networks , 2003, IEEE Trans. Signal Process..

[10]  Márk Jelasity,et al.  Gossip-based aggregation in large dynamic networks , 2005, TOCS.

[11]  Kevin M. Passino,et al.  Stable social foraging swarms in a noisy environment , 2004, IEEE Transactions on Automatic Control.

[12]  Silvia Ferrari,et al.  Necessary conditions for optimality for a distributed optimal control problem , 2010, 49th IEEE Conference on Decision and Control (CDC).