{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T21:16:24Z","timestamp":1694639784247},"reference-count":0,"publisher":"Walter de Gruyter GmbH","issue":"2","license":[{"start":{"date-parts":[[2010,6,1]],"date-time":"2010-06-01T00:00:00Z","timestamp":1275350400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,6,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>In recent years, the interest in human-robot interactions has added a new dimension to the on-line path planning problem by requiring a method that guarantees a risk-free path. This paper presents a streamlined search algorithm for fast path modification. The algorithm is formulated as an optimization problem that evaluates alternative paths nearby each obstacle. Each path is evaluated based on the value of the danger assigned to that path. To reduce the size of the search space, the minimum number of via points necessary to alter the path is initially obtained using a geometrical method. Given the number of via points, the algorithm proceeds to locate the via points around the obstacle such that the resulting path through these via points satisfies all problem constraints. Obtaining a solution in this way renders a fast algorithm for path modification, while it better avoids problems often encountered in other gradient-based search algorithms. Case studies for two planar robots are provided to highlight some of the advantages of the proposed algorithm. Experimental results using a CRS-F3 robot manipulator validate the effectiveness of the algorithm for applications involving human-robot interactions.<\/jats:p>","DOI":"10.2478\/s13230-010-0012-2","type":"journal-article","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T13:59:41Z","timestamp":1280757581000},"page":"130-140","source":"Crossref","is-referenced-by-count":1,"title":["A Streamlined Search Algorithm for Path Modifications of a Safe Robot Manipulator<sup>*<\/sup>"],"prefix":"10.2478","volume":"1","author":[{"given":"Nima","family":"Najmaei","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Western Ontario, London, ON, Canada"}]},{"given":"Mehrdad R.","family":"Kermani","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Western Ontario, London, ON, Canada"}]}],"member":"374","published-online":{"date-parts":[[2010,9,9]]},"container-title":["Paladyn, Journal of Behavioral Robotics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.2478\/s13230-010-0012-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.2478\/s13230-010-0012-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.2478\/s13230-010-0012-2\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.2478\/s13230-010-0012-2\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T11:21:20Z","timestamp":1651058480000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.2478\/s13230-010-0012-2\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,1]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2010,9,9]]},"published-print":{"date-parts":[[2010,6,1]]}},"alternative-id":["10.2478\/s13230-010-0012-2"],"URL":"https:\/\/doi.org\/10.2478\/s13230-010-0012-2","relation":{},"ISSN":["2081-4836"],"issn-type":[{"value":"2081-4836","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,6,1]]}}}