{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:45:26Z","timestamp":1760708726803},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,8,14]],"date-time":"2014-08-14T00:00:00Z","timestamp":1407974400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1007\/s10489-014-0572-7","type":"journal-article","created":{"date-parts":[[2014,8,13]],"date-time":"2014-08-13T13:40:32Z","timestamp":1407937232000},"page":"870-886","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A fuzzy-tabu real time controller for sampling-based motion planning in unknown environment"],"prefix":"10.1007","volume":"41","author":[{"given":"Weria","family":"Khaksar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tang Sai","family":"Hong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mansoor","family":"Khaksar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Omid","family":"Motlagh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,8,14]]},"reference":[{"key":"572_CR1","volume-title":"The complexity of robot motion planning","author":"J Canny","year":"1988","unstructured":"Canny J (1988) The complexity of robot motion planning. The MIT Press, Massachusetts"},{"key":"572_CR2","doi-asserted-by":"crossref","unstructured":"Asano T, Asano T, Guibas L, Hershberger J, Imai H (1985) Visibility-polygon search and Euclidean shortest paths. In: Proceedings of 26th Annual Symposium on Foundations of Computer Science, Oct 21-23, Portland, USA, 155-164","DOI":"10.1109\/SFCS.1985.65"},{"key":"572_CR3","unstructured":"Canny J (1985) Voronoi method for the piano-mover\u2019s problem. In: Proceedings of IEEE International Conference on Robotics and Automation. Mar 25-28, St. Louis, USA, pp 530-535"},{"key":"572_CR4","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1177\/027836498600500106","volume":"5","author":"O Khatib","year":"1986","unstructured":"Khatib O (1986) Real-Time Obstacle Avoidance for Manipulators and Mobile Robots. Int J Rob Res 5:90\u201399. doi: 10.1177\/027836498600500106","journal-title":"Int J Rob Res"},{"key":"572_CR5","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/BF01840369","volume":"2","author":"VJ Lumelsky","year":"1987","unstructured":"Lumelsky VJ, Stepanov AA (1987) Path-planning strategies for a point mobile automaton moving amidst unknown obstacles for arbitrary shape. Algorithmica 2:403\u2013430. doi: 10.1007\/BF01840369","journal-title":"Algorithmica"},{"key":"572_CR6","doi-asserted-by":"crossref","first-page":"397","DOI":"10.5772\/56973","volume":"10","author":"W Khaksar","year":"2013","unstructured":"Khaksar W, Tang SH, Khaksar M, Motlagh O (2013) A Low Dispersion Probabilistic Roadmaps (LD-PRM) Algorithm for Fast and Efficient Sampling-Based Motion Planning. Int J Adv Robot Syst 10:397. doi: 10.5772\/56973","journal-title":"Int J Adv Robot Syst"},{"key":"572_CR7","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1613\/jair.2408","volume":"31","author":"MRK Ryan","year":"2008","unstructured":"Ryan MRK (2008) Exploiting Subgraph Structure in Multi-Robot Path Planning. J Artif Intell Res 31:497\u2013542. doi: 10.1613\/jair.2408","journal-title":"J Artif Intell Res"},{"key":"572_CR8","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1613\/jair.2994","volume":"39","author":"A Nash","year":"2010","unstructured":"Nash A, Koenig S, Felner A, Daniel K (2010) Theta*: Any-Angle Path Planning on Grids. J Artif Intell Res 39:533\u2013579. doi: 10.1613\/jair.2994","journal-title":"J Artif Intell Res"},{"key":"572_CR9","first-page":"15","volume":"20","author":"SH Tang","year":"2012","unstructured":"Tang SH, Khaksar W, Ismail NB, Ariffin MK A (2012) A Review on Robot Motion Planning Approaches. Pertanika J Sci & Technol 20:15\u201329","journal-title":"Pertanika J Sci & Technol"},{"key":"572_CR10","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1163\/156855312X632166","volume":"26","author":"W Khaksar","year":"2012","unstructured":"Khaksar W, Tang SH, Khaksar M, Motlagh O (2012) Sampling-Based Tabu Search Approach for Online Path Planning. Adv Robot 26:1013\u20131034. doi: 10.1163\/156855312X632166","journal-title":"Adv Robot"},{"key":"572_CR11","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/s10489-012-0406-4","volume":"39","author":"HV Hoang","year":"2013","unstructured":"Hoang HV, Viet-Hung D, Md Nasir UL, TaeChoong C (2013) BA*: an online complete coverage algorithm for cleaning robots. Appl Intell 39:217\u2013235. doi: 10.1007\/s10489-012-0406-4","journal-title":"Appl Intell"},{"key":"572_CR12","doi-asserted-by":"crossref","unstructured":"Kala R, Warwick K (2014) Dynamic distributed lanes: motion planning for multiple autonomous vehicles. Appl Intell. doi: 10.1007\/s10489-014-0517-1","DOI":"10.1007\/s10489-014-0517-1"},{"key":"572_CR13","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1109\/70.508439","volume":"12","author":"LE Kawraki","year":"1996","unstructured":"Kawraki LE, Svestka P, Latombe JC, Overmars MH (1996) Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Trans Robot Autom 12:566\u2013580. doi: 10.1109\/70.508439","journal-title":"IEEE Trans Robot Autom"},{"key":"572_CR14","volume-title":"Rapidly-exploring random trees: A new tool for path planning","author":"SM Lavalle","year":"1998","unstructured":"Lavalle SM (1998) Rapidly-exploring random trees: A new tool for path planning. Technical Report TR 98-11, Computer Science Department, Iowa State University"},{"key":"572_CR15","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1177\/0278364911406761","volume":"30","author":"S Karaman","year":"2013","unstructured":"Karaman S (2013) Sampling-based algorithms for optimal motion planning. Int J Rob Res 30:846\u2013894. doi: 10.1177\/0278364911406761","journal-title":"Int J Rob Res"},{"key":"572_CR16","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546877","volume-title":"Planning Algorithms","author":"SM Lavalle","year":"2006","unstructured":"Lavalle SM (2006) Planning Algorithms. Cambridge University Press, Cambridge"},{"key":"572_CR17","volume-title":"Principles of robot motion-theory: algorithms, and implementation","author":"H Choset","year":"2005","unstructured":"Choset H, Lynch KM, Hutchinson S, Kantor G, Burgard W, Kavraki LE, Thrun S (2005) Principles of robot motion-theory: algorithms, and implementation. MIT Press, Cambridge"},{"key":"572_CR18","doi-asserted-by":"crossref","unstructured":"Boor V, Overmars MH, Van der Stappen AF (1999) The Gaussian sampling strategy for probabilistic roadmap planners. In:Proceedings of IEEE International Conference on Robotics and Automation, May 10-15, Detroit, USA, pp 1018\u20131023","DOI":"10.1109\/ROBOT.1999.772447"},{"key":"572_CR19","unstructured":"Branicky MS, LaValle SM, Olson K, Libo Y, Quasi-randomized path planning Proceedings of IEEE International Conference on Robotics and Automation. May 21-26 COEX Seoul Korea (2001)"},{"key":"572_CR20","first-page":"1618","volume-title":"Workspace importance sampling for probabilistic roadmap planning. In: Proceedings of IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS), Sep 28-Oct 2","author":"H Kurniawati","year":"2004","unstructured":"Kurniawati H, Hsu D (2004) Workspace importance sampling for probabilistic roadmap planning. In: Proceedings of IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS), Sep 28-Oct 2. Sendai, Japan, pp 1618\u20131623"},{"key":"572_CR21","first-page":"3874","volume-title":"Hybrid PRM Sampling with a Cost-Sensitive Adaptive Strategy. In: Proceedings of IEEE International Conference on Robotics and Automation (ICRA). Aug 2-6","author":"D Hsu","year":"2005","unstructured":"Hsu D, Sanchez-Ante G, Zheng S (2005) Hybrid PRM Sampling with a Cost-Sensitive Adaptive Strategy. In: Proceedings of IEEE International Conference on Robotics and Automation (ICRA). Aug 2-6. Alberta, Canada, pp 3874\u20133880"},{"key":"572_CR22","doi-asserted-by":"crossref","unstructured":"Hsu D, Tingting J, Reif J, Zheng S (2003) The bridge test for sampling narrow passages with probabilistic roadmap planners. In Proceedings of IEEE International Conference on Robotics and Automation (ICRA), Oct, Las Vegas, Nevada, pp 4420\u20134426","DOI":"10.1109\/ROBOT.2003.1242285"},{"key":"572_CR23","doi-asserted-by":"crossref","unstructured":"Yershova KA, Jaillet L, Simoen T, LaValle SM (2005) Dynamic Domain RRTs: Efficient exploration by controlling the sampling domain. In: Proceedings of IEEE International Conference on Robotics and Automation, April, Barcelona, Spain, pp 3856-3861","DOI":"10.1109\/ROBOT.2005.1570709"},{"key":"572_CR24","doi-asserted-by":"crossref","unstructured":"Jaillet L, Yershova A, LaValle SM, Simeon T (2005) Adaptive tuning of the sampling domain for Dynamic-Domain RRTs. In: Proceedings of IEEE International Conference on Robotics and Automation, April, Barcelona, Spain, pp 2851-2856","DOI":"10.1109\/IROS.2005.1545607"},{"key":"572_CR25","doi-asserted-by":"crossref","unstructured":"Ferguson D, Kalra N, Stentz A (2006) Replanning with RRTs. In: Proceedings of IEEE International Conference on Robotics and Automation (ICRA), pp. 1243-1248","DOI":"10.1109\/ROBOT.2006.1641879"},{"key":"572_CR26","doi-asserted-by":"crossref","unstructured":"Bruce J, Veloso M (2002) Real-time randomized path planning for robot navigation. In: Proceedings of IEEE\/RSJ International Conference on Intelligent Robots and Systems. pp 2383-2388","DOI":"10.1109\/IRDS.2002.1041624"},{"key":"572_CR27","unstructured":"BekrisK E, Kavraki LE (2007) Greedy but Safe Replanning under Kinodynamic Constraints. In: Proceedings of IEEE International Conference on Robotics and Automation, Roma, Italy, 704-710"},{"key":"572_CR28","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover F (1989) Tabu Search-Part I. ORSA J on Comput 1:190\u2013206. doi: 10.1287\/ijoc.1.3.190","journal-title":"ORSA J on Comput"},{"key":"572_CR29","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F Glover","year":"1990","unstructured":"Glover F (1990) Tabu Search-Part II. ORSA J on Comput 2:4\u201332. doi: 10.1287\/ijoc.1.3.190","journal-title":"ORSA J on Comput"},{"key":"572_CR30","first-page":"221","volume":"24","author":"LD Whitley","year":"2004","unstructured":"Whitley LD, Howe AE, Watson JP (2004) Linking Search Space Structure, Run-Time Dynamics, and Problem Difficulty: A Step Toward Demystifying Tabu Search. J Artif Intell Res 24:221\u2013261. doi: 10.1613\/jair.1576","journal-title":"J Artif Intell Res"},{"key":"572_CR31","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/MRA.2008.921543","volume":"15","author":"E Masehian","year":"2008","unstructured":"Masehian E, Amin-Naseri MR (2008) Sensor-based robot motion planning - A Tabu search approach. IEEE Robot & Autom Mag 15:48\u201357. doi: 10.1109\/MRA.2008.921543","journal-title":"IEEE Robot & Autom Mag"},{"key":"572_CR32","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s10489-011-0321-0","volume":"37","author":"AR Hedar","year":"2012","unstructured":"Hedar AR, Ali AF (2012) Tabu search with multi-level neighborhood structures for high dimensional problems. Appl Intell 37:189\u2013206. doi: 10.1007\/s10489-011-0321-0","journal-title":"Appl Intell"},{"key":"572_CR33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10489-013-0441-9","volume":"40","author":"SM Salt","year":"2014","unstructured":"Salt SM, Arafeh AM (2014) Cell assignment in hybrid CMOS\/nanodevices architecture using Tabu Search. Appl Intell 40:1\u201312. doi: 10.1007\/s10489-013-0441-9","journal-title":"Appl Intell"},{"key":"572_CR34","doi-asserted-by":"crossref","unstructured":"Hong TL, Sheu HC, HE YK (2002) Multicriteria scheduling using fuzzy theory and tabu search. Int J Prod Res 40:1221\u20131234. doi: 10.1080\/00207540110098832","DOI":"10.1080\/00207540110098832"},{"key":"572_CR35","doi-asserted-by":"crossref","unstructured":"Li C, Liao X, Yu J (2004) Tabu search for fuzzy optimization and applications. Inform Sci 158:3\u201313. doi: 10.1016\/j.ins.2003.07.015","DOI":"10.1016\/j.ins.2003.07.015"},{"key":"572_CR36","doi-asserted-by":"crossref","unstructured":"Zheng Y (2010) Extended tabu search on fuzzy traveling salesman problem in multi-criteria analysis. In: Chen B (ed) Lecture Notes in Computer Science. Springer, Berlin, Heidelberg, pp 314\u2013324","DOI":"10.1007\/978-3-642-14355-7_32"},{"key":"572_CR37","doi-asserted-by":"crossref","unstructured":"Talbi N, Belarbi K (2011) Optimization of fuzzy controller using tabu search and particle swarm optimization. In: International Conference on Hybrid Intelligent Systems (HIS). Dec 5\u20138, Malaca, Malaysia, pp 561\u2013565","DOI":"10.1109\/HIS.2011.6122166"},{"key":"572_CR38","unstructured":"Bjork KM, Mezei J (2013) A fuzzy tabu search approach to solve a vehicle routing problem. In: Hutchison D (ed) Lecture Notes in Computer Science. Springer, Berlin, Heidelberg, pp 210\u2013217"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-014-0572-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-014-0572-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-014-0572-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,23]],"date-time":"2020-08-23T05:13:20Z","timestamp":1598159600000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-014-0572-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,14]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["572"],"URL":"https:\/\/doi.org\/10.1007\/s10489-014-0572-7","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,14]]}}}