Path Planning on Hierarchical Bundles with Differential Evolution

Computing hierarchical routing networks in polygonal maps is significant to realize the efficient coordination of agents, robots and systems in general; and the fact of considering obstacles in the map, makes the computation of efficient networks a relevant need for cluttered environments. In this paper, we present an approach to compute the minimal-length hierarchical topologies in polygonal maps by Differential Evolution and Route Bundling Concepts. Our computational experiments in scenarios considering convex and non-convex configuration of polygonal maps show the feasibility of the proposed approach.

[1]  Jarke J. van Wijk,et al.  Force‐Directed Edge Bundling for Graph Visualization , 2009, Comput. Graph. Forum.

[2]  Tomoyuki Miyashita,et al.  Route bundling in polygonal domains using Differential Evolution , 2017, Robotics and biomimetics.

[3]  Steven M. LaValle,et al.  Rapidly-Exploring Random Trees: Progress and Prospects , 2000 .

[4]  Wenzhong Guo,et al.  A heuristic for constructing a rectilinear Steiner tree by reusing routing resources over obstacles , 2016, Integr..

[5]  Liang Li,et al.  Obstacle-avoiding rectilinear Steiner tree construction in sequential and parallel approach , 2014, Integr..

[6]  Tomoyuki Miyashita,et al.  On k-subset sum using enumerative encoding , 2016, 2016 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT).

[7]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[8]  Victor Parque,et al.  Bijections for the numeric representation of labeled graphs , 2014, 2014 IEEE International Conference on Systems, Man, and Cybernetics (SMC).

[9]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[10]  Vojtěch Jarník,et al.  O minimálních grafech, obsahujících $n$ daných bodů , 1934 .

[11]  Xing Zhang,et al.  Online Path Planning for UAV Using an Improved Differential Evolution Algorithm , 2011 .

[12]  Haibin Duan,et al.  Imperialist competitive algorithm optimized artificial neural networks for UCAV global path planning , 2014, Neurocomputing.

[13]  Tomoyuki Miyashita,et al.  On succinct representation of directed graphs , 2017, 2017 IEEE International Conference on Big Data and Smart Computing (BigComp).

[14]  Victor Parque,et al.  Neural Computing with Concurrent Synchrony , 2014, ICONIP.

[15]  Jeffrey Heer,et al.  Divided Edge Bundling for Directional Network Data , 2011, IEEE Transactions on Visualization and Computer Graphics.

[16]  Tomás Lozano-Pérez,et al.  An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.

[17]  Emden R. GansnerYifan.  Multilevel Agglomerative Edge Bundling for Visualizing Large Graphs , 2011 .

[18]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[19]  Yu Hu,et al.  A full-scale solution to the rectilinear obstacle-avoiding Steiner problem , 2008, Integr..

[20]  M. G. Mohanan,et al.  A survey of robotic motion planning in dynamic environments , 2018, Robotics Auton. Syst..

[21]  Marius Kloetzer,et al.  Trajectory planning for a car-like robot by environment abstraction , 2012, Robotics Auton. Syst..

[22]  D. T. Lee,et al.  Euclidean shortest paths in the presence of rectilinear barriers , 1984, Networks.

[23]  S. LaValle.  Rapidly-exploring random trees : a new tool for path planning , 1998 .

[24]  Mansoor Davoodi Monfared,et al.  Clear and smooth path planning , 2015, Appl. Soft Comput..

[25]  Hong Zhou,et al.  Geometry-Based Edge Clustering for Graph Visualization , 2008, IEEE Transactions on Visualization and Computer Graphics.

[26]  Lydia Tapia,et al.  Path-guided artificial potential fields with stochastic reachable sets for motion planning in highly dynamic environments , 2015, 2015 IEEE International Conference on Robotics and Automation (ICRA).

[27]  Matthias Müller-Hannemann,et al.  A near linear time approximation scheme for Steiner tree among obstacles in the plane , 2010, Comput. Geom..

[28]  Tomoyuki Miyashita,et al.  Optimization of route bundling via differential evolution with a convex representation , 2017, 2017 IEEE International Conference on Real-time Computing and Robotics (RCAR).

[29]  Tomoyuki Miyashita,et al.  Bundling n-Stars in Polygonal Maps , 2017, 2017 IEEE 29th International Conference on Tools with Artificial Intelligence (ICTAI).

[30]  Pawel Winter,et al.  Auclidean Steiner Minimal Trees with Obstacles and Steiner Visibility Graphs , 1993, Discret. Appl. Math..

[31]  B. Faverjon,et al.  Probabilistic Roadmaps for Path Planning in High-Dimensional Con(cid:12)guration Spaces , 1996 .

[32]  Tomoyuki Miyashita,et al.  Computing Path Bundles in Bipartite Networks , 2017, SIMULTECH.

[33]  Jens Nielsen,et al.  Short trees in polygons , 2002, Discret. Appl. Math..

[34]  Robin De Keyser,et al.  A hierarchical global path planning approach for mobile robots based on multi-objective particle swarm optimization , 2017, Appl. Soft Comput..

[35]  Pierre Feyzeau,et al.  Path planning: A 2013 survey , 2013, Proceedings of 2013 International Conference on Industrial Engineering and Systems Management (IESM).

[36]  Jianhua Zhang,et al.  Robot path planning in uncertain environment using multi-objective particle swarm optimization , 2013, Neurocomputing.

[37]  Branko Ster,et al.  An Integrated Learning Approach to Environment Modelling in Mobile Robot Navigation , 2002, Neurocomputing.

[38]  Victor Parque,et al.  Searching for machine modularity using explorit , 2014, 2014 IEEE International Conference on Systems, Man, and Cybernetics (SMC).

[39]  Danny Holten,et al.  Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data , 2006, IEEE Transactions on Visualization and Computer Graphics.

[40]  Jianping Yuan,et al.  Optimal trajectory planning of free-floating space manipulator using differential evolution algorithm , 2018 .

[41]  Bernard Chazelle,et al.  A theorem on polygon cutting with applications , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[42]  R. Courant,et al.  What Is Mathematics , 1943 .