{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T15:18:29Z","timestamp":1725981509773},"publisher-location":"Cham","reference-count":45,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319938141"},{"type":"electronic","value":"9783319938158"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-93815-8_25","type":"book-chapter","created":{"date-parts":[[2018,6,15]],"date-time":"2018-06-15T19:21:10Z","timestamp":1529090470000},"page":"251-260","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Path Planning on Hierarchical Bundles with Differential Evolution"],"prefix":"10.1007","author":[{"given":"Victor","family":"Parque","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomoyuki","family":"Miyashita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,16]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Chazelle, B.: A theorem on polygon cutting with applications. In: Proceedings of 23rd IEEE Symposium on Foundations of Computer Science, pp. 339\u2013349 (1982)","DOI":"10.1109\/SFCS.1982.58"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Chiang, H.T., Malone, N., Lesser, K., Oishi, M., Tapia, L.: Path-guided artificial potential fields with stochastic reachable sets for motion planning in highly dynamic environments, pp. 2347\u20132354, May 2015","DOI":"10.1109\/ICRA.2015.7139511"},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.vlsi.2013.08.001","volume":"47","author":"W Chow","year":"2014","unstructured":"Chow, W., Li, L., Young, E., Sham, C.: Obstacle-avoiding rectilinear Steiner tree construction in sequential and parallel approach. Integr. VLSI J. 47, 105\u2013114 (2014)","journal-title":"Integr. VLSI J."},{"key":"25_CR4","volume-title":"Introduction to Algorithms","author":"T Cormen","year":"1993","unstructured":"Cormen, T., Leiserson, C., Rivest, R.: Introduction to Algorithms. MIT Press, Cambridge (1993)"},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"1277","DOI":"10.1109\/TVCG.2008.135","volume":"14","author":"W Cui","year":"2008","unstructured":"Cui, W., Zhou, H., Qu, H., Wong, P.C., Li, X.: Geometry-based edge clustering for graph visualization. IEEE Trans. Visual. Comput. Graph. 14, 1277\u20131284 (2008)","journal-title":"IEEE Trans. Visual. Comput. Graph."},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1016\/j.asoc.2015.04.017","volume":"32","author":"M Davoodi","year":"2015","unstructured":"Davoodi, M., Panahi, F., Mohades, A., Hashemi, S.N.: Clear and smooth path planning. Appl. Soft Comput. 32, 568\u2013579 (2015)","journal-title":"Appl. Soft Comput."},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.neucom.2012.09.039","volume":"125","author":"Haibin Duan","year":"2014","unstructured":"Duan, H., Huang, L.: Imperialist competitive algorithm optimized artificial neural networks for UCAV global path planning. Neurocomputing, 125, 166\u2013171 (2014). Advances in Neural Network Research and Applications Advances in Bio-Inspired Computing: Techniques and Applications","journal-title":"Neurocomputing"},{"key":"25_CR9","unstructured":"exedesign: Factory. http:\/\/www.blendswap.com\/blends\/view\/55233"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Gansner, E.R., Hu, Y., North, S., Scheidegger, C.: Multilevel agglomerative edge bundling for visualizing large graphs. In: IEEE Pacific Visualization Symposium, pp. 187\u2013194 (2011)","DOI":"10.1109\/PACIFICVIS.2011.5742389"},{"issue":"4","key":"25_CR11","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1016\/j.robot.2011.12.004","volume":"60","author":"N Ghita","year":"2012","unstructured":"Ghita, N., Kloetzer, M.: Trajectory planning for a car-like robot by environment abstraction. Robot. Auton. Syst. 60(4), 609\u2013619 (2012)","journal-title":"Robot. Auton. Syst."},{"issue":"5","key":"25_CR12","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1109\/TVCG.2006.147","volume":"12","author":"D. Holten","year":"2006","unstructured":"Holten, D.: Hirerarchical edge bundles: visualization of adjacency relations in hierarchical data. In: IEEE Pacific Visualization Symposium, pp. 187\u2013194 (2006)","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"issue":"3","key":"25_CR13","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1111\/j.1467-8659.2009.01450.x","volume":"28","author":"Danny Holten","year":"2009","unstructured":"Holten, D., van Wijk, J.J.: Force-directed edge bundling for graph visualization. In: Eurographics, Symposium on Visualization (2009)","journal-title":"Computer Graphics Forum"},{"key":"25_CR14","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/j.vlsi.2007.10.002","volume":"41","author":"TT Jing","year":"2008","unstructured":"Jing, T.T., Hu, Y., Feng, Z., Hong, X., Hu, X., Yan, G.: A full-scale solution to the rectilinear obstacle-avoiding Steiner problem. Integr. VLSI J. 41, 413\u2013425 (2008)","journal-title":"Integr. VLSI J."},{"issue":"4","key":"25_CR15","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1109\/70.508439","volume":"12","author":"LE Kavraki","year":"1996","unstructured":"Kavraki, L.E., Svestka, P., Latombe, J.C., Overmars, M.H.: Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Trans. Robot. Autom. 12(4), 566\u2013580 (1996)","journal-title":"IEEE Trans. Robot. Autom."},{"key":"25_CR16","unstructured":"LaValle, S.M.: Rapidly-exploring random trees: a new tool for path planning. Technical report. Computer Science Department, Iowa State University (TR 98\u201311)"},{"key":"25_CR17","unstructured":"LaValle, S.M., Kuffner Jr., J.J.: Rapidly-exploring random trees: progress and prospects (2000)"},{"issue":"3","key":"25_CR18","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1002\/net.3230140304","volume":"14","author":"DT Lee","year":"1984","unstructured":"Lee, D.T., Preparata, F.P.: Euclidean shortest paths in the presence of rectilinear barriers. Networks 14(3), 393\u2013410 (1984)","journal-title":"Networks"},{"issue":"10","key":"25_CR19","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/359156.359164","volume":"22","author":"T Lozano-P\u00e9rez","year":"1979","unstructured":"Lozano-P\u00e9rez, T., Wesley, M.A.: An algorithm for planning collision-free paths among polyhedral obstacles. Commun. ACM 22(10), 560\u2013570 (1979)","journal-title":"Commun. ACM"},{"key":"25_CR20","unstructured":"LWP23D: Game map: Factory. https:\/\/www.blendswap.com\/blends\/view\/81600"},{"key":"25_CR21","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.asoc.2017.05.012","volume":"59","author":"TT Mac","year":"2017","unstructured":"Mac, T.T., Copot, C., Tran, D.T., Keyser, R.D.: A hierarchical global path planning approach for mobile robots based on multi-objective particle swarm optimization. Appl. Soft Comput. 59, 68\u201376 (2017)","journal-title":"Appl. Soft Comput."},{"key":"25_CR22","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.robot.2017.10.011","volume":"100","author":"M Mohanan","year":"2018","unstructured":"Mohanan, M., Salgoankar, A.: A survey of robotic motion planning in dynamic environments. Robot. Auton. Syst. 100, 171\u2013185 (2018)","journal-title":"Robot. Auton. Syst."},{"key":"25_CR23","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.comgeo.2009.01.011","volume":"43","author":"M M\u00fcller-Hannemann","year":"2010","unstructured":"M\u00fcller-Hannemann, M., Tazari, S.: A near linear time approximation scheme for Steiner tree among obstacles in the plane. Comput. Geom. Theory Appl. 43, 395\u2013409 (2010)","journal-title":"Comput. Geom. Theory Appl."},{"key":"25_CR24","doi-asserted-by":"crossref","unstructured":"Parque, V., Kobayashi, M., Higashi, M.: Bijections for the numeric representation of labeled graphs. In: IEEE International Conference on Systems, Man and Cybernetics, pp. 447\u2013452 (2014)","DOI":"10.1109\/SMC.2014.6973948"},{"key":"25_CR25","doi-asserted-by":"crossref","unstructured":"Parque, V., Kobayashi, M., Higashi, M.: Searching for machine modularity using Explorit. In: IEEE International Conference on Systems, Man and Cybernetics, pp. 2599\u20132604 (2014)","DOI":"10.1109\/SMC.2014.6974319"},{"key":"25_CR26","doi-asserted-by":"crossref","unstructured":"Parque, V., Miura, S., Miyashita, T.: Optimization of route bundling via differential evolution with a convex representation. In: 2017 IEEE International Conference on Real-time Computing and Robotics (RCAR), pp. 727\u2013732, July 2017","DOI":"10.1109\/RCAR.2017.8311950"},{"key":"25_CR27","doi-asserted-by":"crossref","unstructured":"Parque, V., Miyashita, T.: On k-subset sum using enumerative encoding. In: IEEE International Symposium on Signal Processing and Information Technology, pp. 81\u201386 (2016)","DOI":"10.1109\/ISSPIT.2016.7886013"},{"key":"25_CR28","doi-asserted-by":"crossref","unstructured":"Parque, V., Miyashita, T.: On succinct representation of directed graphs. In: IEEE International Conference on Big Data and Smart Computing, pp. 199\u2013205 (2017)","DOI":"10.1109\/BIGCOMP.2017.7881738"},{"key":"25_CR29","unstructured":"Parque, V., Kobayashi, M., Higashi, M.: Optimisation of bundled routes. In: 16th International Conference on Geometry and Graphics, pp. 893\u2013902 (2014)"},{"key":"25_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/978-3-319-12637-1_38","volume-title":"Neural Information Processing","author":"V Parque","year":"2014","unstructured":"Parque, V., Kobayashi, M., Higashi, M.: Neural computing with concurrent synchrony. In: Loo, C.K., Yap, K.S., Wong, K.W., Teoh, A., Huang, K. (eds.) ICONIP 2014, Part I. LNCS, vol. 8834, pp. 304\u2013311. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-12637-1_38"},{"key":"25_CR31","doi-asserted-by":"crossref","unstructured":"Parque, V., Miura, S., Miyashita, T.: Computing path bundles in bipartite networks. In: 7th International Conference on Simulation and Modelling Methodologies, Technologies and Applications, pp. 422\u2013427, Madrid, Spain (2017)","DOI":"10.5220\/0006480604220427"},{"issue":"1","key":"25_CR32","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1186\/s40638-017-0079-x","volume":"4","author":"V Parque","year":"2017","unstructured":"Parque, V., Miura, S., Miyashita, T.: Route bundling in polygonal domains using differential evolution. Robot. Biomimetics 4(1), 22 (2017)","journal-title":"Robot. Biomimetics"},{"key":"25_CR33","doi-asserted-by":"crossref","unstructured":"Parque, V., Miyashita, T.: Bundling n-Stars in polygonal maps. In: 29th IEEE International Conference on Tools with Artificial Intelligence, 6\u20138 November, Boston, USA (2017)","DOI":"10.1109\/ICTAI.2017.00063"},{"issue":"2","key":"25_CR34","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100\u2013107 (1968)","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"key":"25_CR35","volume-title":"What is Mathematics?","author":"H Robbins","year":"1941","unstructured":"Robbins, H., Courant, R.: What is Mathematics?. Oxford University Press, Oxford (1941)"},{"key":"25_CR36","doi-asserted-by":"crossref","unstructured":"\u0160ter, B.: An integrated learning approach to environment modelling in mobile robot navigation. Neurocomputing 57, 215\u2013238 (2004). New Aspects in Neurocomputing: 10th European Symposium on Artificial Neural Networks 2002","DOI":"10.1016\/j.neucom.2003.10.005"},{"issue":"12","key":"25_CR37","doi-asserted-by":"publisher","first-page":"2354","DOI":"10.1109\/TVCG.2011.190","volume":"17","author":"D Selassie","year":"2011","unstructured":"Selassie, D., Heller, B., Heer, J.: Divided edge bundling for directional network data. IEEE Trans. Visual. Comput. Graph. 17(12), 2354\u20132363 (2011)","journal-title":"IEEE Trans. Visual. Comput. Graph."},{"key":"25_CR38","unstructured":"Souissi, O., Benatitallah, R., Duvivier, D., Artiba, A., Belanger, N., Feyzeau, P.: Path planning: a 2013 survey. In: Proceedings of 2013 International Conference on Industrial Engineering and Systems Management (IESM), pp. 1\u20138, October 2013"},{"issue":"8","key":"25_CR39","doi-asserted-by":"crossref","first-page":"223","DOI":"10.21136\/CPMF.1934.122548","volume":"063","author":"J Vojt\u011bch","year":"1934","unstructured":"Vojt\u011bch, J., K\u00f6ssler, M.: O minim\u00e1ln\u00edch grafech, obsahuj\u00edc\u00edch $$n$$ dan\u00fdch bod\u016f. \u010casopis pro p\u011bstov\u00e1n\u00ed matematiky a fysiky 063(8), 223\u2013235 (1934)","journal-title":"\u010casopis pro p\u011bstov\u00e1n\u00ed matematiky a fysiky"},{"issue":"6","key":"25_CR40","doi-asserted-by":"publisher","first-page":"1525","DOI":"10.1016\/j.asr.2018.01.011","volume":"61","author":"M Wang","year":"2018","unstructured":"Wang, M., Luo, J., Fang, J., Yuan, J.: Optimal trajectory planning of free-floating space manipulator using differential evolution algorithm. Adv. Space Res. 61(6), 1525\u20131536 (2018)","journal-title":"Adv. Space Res."},{"key":"25_CR41","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0166-218X(93)90092-3","volume":"47","author":"P Winter","year":"1993","unstructured":"Winter, P.: Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs. Discrete Appl. Math. 47, 187\u2013206 (1993)","journal-title":"Discrete Appl. Math."},{"key":"25_CR42","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S0166-218X(01)00256-6","volume":"118","author":"P Winter","year":"2002","unstructured":"Winter, P., Zachariasen, M., Nielsen, J.: Short trees in Polygons. Discrete Appl. Math. 118, 55\u201372 (2002)","journal-title":"Discrete Appl. Math."},{"key":"25_CR43","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.vlsi.2016.06.001","volume":"55","author":"H Zhang","year":"2016","unstructured":"Zhang, H., Ye, D., Guo, W.: A heuristic for constructing a rectilinear Steiner tree by reusing routing resources over obstacles. Integr. VLSI J. 55, 162\u2013175 (2016)","journal-title":"Integr. VLSI J."},{"issue":"1","key":"25_CR44","doi-asserted-by":"publisher","first-page":"6349","DOI":"10.3182\/20110828-6-IT-1002.01807","volume":"44","author":"Xing Zhang","year":"2011","unstructured":"Zhang, X., Chen, J., Xin, B., Fang, H.: Online path planning for UAV using an improved differential evolution algorithm. IFAC Proc. Vol. 44(1), 6349\u20136354 (2011). 18th IFAC World Congress","journal-title":"IFAC Proceedings Volumes"},{"key":"25_CR45","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.neucom.2012.09.019","volume":"103","author":"Y Zhang","year":"2013","unstructured":"Zhang, Y., Gong, D.W., Zhang, J.H.: Robot path planning in uncertain environment using multi-objective particle swarm optimization. Neurocomputing 103, 172\u2013185 (2013)","journal-title":"Neurocomputing"}],"container-title":["Lecture Notes in Computer Science","Advances in Swarm Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-93815-8_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,3]],"date-time":"2020-11-03T19:24:46Z","timestamp":1604431486000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-93815-8_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319938141","9783319938158"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-93815-8_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}