{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T04:05:11Z","timestamp":1749787511260,"version":"3.41.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Intelligent and Robotic Systems"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1023\/a:1026283627113","type":"journal-article","created":{"date-parts":[[2003,11,3]],"date-time":"2003-11-03T22:53:28Z","timestamp":1067900008000},"page":"31-53","source":"Crossref","is-referenced-by-count":1,"title":["Predicting the Performance of Randomized Parallel Search: An Application to Robot Motion Planning"],"prefix":"10.1007","volume":"38","author":[{"given":"Daniel J.","family":"Challou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria","family":"Gini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vipin","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Karypis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5118230_CR1","series-title":"Technical Report","volume-title":"Average and randomized complexity of distributed problems","author":"N. Alanberg-Navony","year":"1994","unstructured":"Alanberg-Navony, N., Itai, A., and Moran, S.: 1994, Average and randomized complexity of distributed problems, Technical Report, Technion, Haifa, Israel."},{"key":"5118230_CR2","doi-asserted-by":"crossref","unstructured":"Amato, N. M. and Dale, L. K.: 1999, Probabilistic roadmap methods are embarrassingly parallel, in: Proc. IEEE Internat. Conf. on Robotics and Automation, pp. 688\u2013694.","DOI":"10.1109\/ROBOT.1999.770055"},{"key":"5118230_CR3","first-page":"115","volume-title":"Practical Motion Planning in Robotics: Current Approaches and Future Directions","author":"D. Challou","year":"1998","unstructured":"Challou, D., Boley, D., Gini, M., Kumar, V., and Olson, C.: 1998, Parallel search algorithms for robot motion planning, in: K. Gupta and A. del Pobil (eds), Practical Motion Planning in Robotics: Current Approaches and Future Directions, Wiley, New York, pp. 115\u2013131."},{"key":"5118230_CR4","first-page":"46","volume":"2","author":"D. Challou","year":"1993","unstructured":"Challou, D., Gini, M., and Kumar, V.: 1993, Parallel search algorithms for robot motion planning, in: Proc. of IEEE Internat. Conf. on Robotics and Automation, Vol. 2., pp. 46\u201351.","journal-title":"Proc. of IEEE Internat. Conf. on Robotics and Automation"},{"key":"5118230_CR5","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1613\/jair.518","volume":"9","author":"D. J. Cook","year":"1998","unstructured":"Cook, D. J. and Varnell, R. C.: 1998, Adaptive parallel iterative deepening search, J. Artificial Intelligence Res.\n9, 139\u2013166.","journal-title":"J. Artificial Intelligence Res."},{"key":"5118230_CR6","volume-title":"The connection machine CM-5 Technical Summary","author":"T. M. Corporation","year":"1992","unstructured":"Corporation, T. M.: 1992, The connection machine CM-5 Technical Summary, Thinking Machines Corporation, Cambridge, MA."},{"key":"5118230_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1007\/BFb0013064","volume-title":"LPAR'92: Logic Programming and Automated Reasoning","author":"W. Ertel","year":"1992","unstructured":"Ertel, W.: 1992, OR-parallel theorem proving with random competition, in: A. Voronokov (ed.), LPAR'92: Logic Programming and Automated Reasoning, Lecture Notes in Artificial Intelligence 624, Springer, Berlin, pp. 226\u2013237."},{"key":"5118230_CR8","series-title":"Technical Report","first-page":"62","volume-title":"Working Notes of the 1993 AAAI Spring Symposium for Innovative Applications of Massive Parallelism","author":"W. Ertel","year":"1993","unstructured":"Ertel, W.: 1993, Massively parallel search with random competition, in: Working Notes of the 1993 AAAI Spring Symposium for Innovative Applications of Massive Parallelism, pp. 62\u201369, AAAI Press, Menlo Park, CA; available as Technical Report No. TR SS-93-04."},{"key":"5118230_CR9","series-title":"Lecture Notes in Computer Science","volume-title":"Solving Combinatorial Optimization Problems in Parallel: Methods and Techniques","year":"1996","unstructured":"Ferreira, A. and Pardalos, P. (eds): 1996, Solving Combinatorial Optimization Problems in Parallel: Methods and Techniques, Lecture Notes in Computer Science 1054, State-of-the-Art Surveys, Springer, New York."},{"issue":"1","key":"5118230_CR10","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1109\/69.755612","volume":"11","author":"A. Grama","year":"1999","unstructured":"Grama, A. and Kumar, V.: 1999, State of the art in parallel search techniques for discrete optimization problems, IEEE Trans. Knowledge Data Engrg.\n11(1), 28\u201335.","journal-title":"IEEE Trans. Knowledge Data Engrg."},{"key":"5118230_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/3-540-64574-8_393","volume-title":"Tasks and Methods in Applied Artificial Intelligence","author":"D. Henrich","year":"1998","unstructured":"Henrich, D., Wurrl, C., and Woern, H.: 1998, Multi-directional search with goal switching for robot path planning, in: A. P. del Pobil, J. Mira and M. Ali (eds), Tasks and Methods in Applied Artificial Intelligence, Lecture Notes in Artificial Intelligence 1416, Springer, Berlin, pp. 75\u201384."},{"key":"5118230_CR12","volume-title":"Introduction to Probability Theory","author":"P. Hoel","year":"1971","unstructured":"Hoel, P., Port, S., and Stone, C.: 1971, Introduction to Probability Theory, Houghton Mifflin Company, Boston, MA."},{"key":"5118230_CR13","volume-title":"Stochastic Local Search \u2013 Methods, Models, Applications","author":"H. H. Hoos","year":"1998","unstructured":"Hoos, H. H.: 1998, Stochastic Local Search \u2013 Methods, Models, Applications, PhD Thesis, the Darmstadt University of Technology, Germany."},{"key":"5118230_CR14","first-page":"238","volume-title":"Proc. of the 14th Conf. on Uncertainty in Artificial Intelligence","author":"H. H. Hoos","year":"1998","unstructured":"Hoos, H. H. and St\u00fctzle, T.: 1998, Evaluating Las Vegas algorithms \u2013 Pitfalls and remedies, in: Proc. of the 14th Conf. on Uncertainty in Artificial Intelligence, pp. 238\u2013245, Morgan Kaufmann, Los Altos, CA."},{"key":"5118230_CR15","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/978-1-4613-3282-4_8","volume-title":"Advances in Randomized Parallel Computing, Combinatorial Optimization Series","author":"D. Hsu","year":"1999","unstructured":"Hsu, D., Latombe, J., Motwani, R., and Kavraki, L.: 1999, Capturing the connectivity of highdimensional geometric spaces by parallelizable random sampling techniques, in: P. Pardalos and S. Rajasekaran (eds), Advances in Randomized Parallel Computing, Combinatorial Optimization Series, Kluwer Academic Publishers, Dordrecht, pp. 159\u2013182."},{"issue":"12","key":"5118230_CR16","doi-asserted-by":"crossref","first-page":"1665","DOI":"10.1109\/12.9745","volume":"37","author":"V. Janakiram","year":"1988","unstructured":"Janakiram, V., Agrawal, D., and Mehrotra, R.: 1988, A randomized parallel backtracking algorithm, IEEE Trans. Computers\n37(12), 1665\u20131675.","journal-title":"IEEE Trans. Computers"},{"issue":"3","key":"5118230_CR17","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1145\/174130.174145","volume":"40","author":"R. Karp","year":"1993","unstructured":"Karp, R. and Zhang, Y.: 1993, Randomized parallel algorothms for backtrack search and branch-and-bound computation, J. ACM\n40(3), 765\u2013789.","journal-title":"J. ACM"},{"key":"5118230_CR18","first-page":"33","volume-title":"Practical Motion Planning in Robotics: Current Approaches and Future Directions","author":"L. E. Kavraki","year":"1998","unstructured":"Kavraki, L. E. and Latombe, J. C.: 1998, Probabilistic roadmaps for robot path planning, in: K. Gupta and A. del Pobil (eds), Practical Motion Planning in Robotics: Current Approaches and Future Directions, Wiley, New York, pp. 33\u201353."},{"issue":"8","key":"5118230_CR19","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1002\/rob.1033","volume":"18","author":"S. W. Kim","year":"2001","unstructured":"Kim, S. W. and Boley, D.: 2001, Building and navigating a network of local minima, J. Robotic Systems\n18(8), 405\u2013419.","journal-title":"J. Robotic Systems"},{"key":"5118230_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-4022-9","volume-title":"Robot Motion Planning","author":"J. C. Latombe","year":"1991","unstructured":"Latombe, J. C.: 1991, Robot Motion Planning, Kluwer Academic Publishers, Norwell, MA."},{"key":"5118230_CR21","doi-asserted-by":"crossref","unstructured":"Li, G.-J. and Wah, B. W.: 1986, Coping with anomalies in parallel branch-and-bound algorithms, IEEE Trans. Computers\n35.","DOI":"10.1109\/TC.1986.5009434"},{"key":"5118230_CR22","unstructured":"Mehrotra, R. and Gehringer, E. F.: 1985, Superlinear speedup through randomized algorithms, in: Proc. of Internat. Conf. on Parallel Processing, pp. 291\u2013300."},{"issue":"4","key":"5118230_CR23","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1109\/71.219757","volume":"4","author":"V. N. Rao","year":"1993","unstructured":"Rao, V. N. and Kumar, V.: 1993, On the efficiency of parallel backtracking, IEEE Trans. Parallel Distributed Systems\n4(4), 427\u2013437.","journal-title":"IEEE Trans. Parallel Distributed Systems"},{"key":"5118230_CR24","volume-title":"Modern Heuristic Techniques for Combinatorial Problems","author":"C. R. Reeves","year":"1993","unstructured":"Reeves, C. R.: 1993, Modern Heuristic Techniques for Combinatorial Problems, Wiley, New York."},{"key":"5118230_CR25","doi-asserted-by":"crossref","unstructured":"Reif, J.: 1979, Complexity of the Mover's problem and generalizations, in: Proc. of IEEE Symposium on Foundations of Computer Science, pp. 421\u2013427.","DOI":"10.1109\/SFCS.1979.10"}],"container-title":["Journal of Intelligent and Robotic Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1026283627113.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1026283627113\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1026283627113.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T10:02:07Z","timestamp":1749722527000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1026283627113"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["5118230"],"URL":"https:\/\/doi.org\/10.1023\/a:1026283627113","relation":{},"ISSN":["0921-0296","1573-0409"],"issn-type":[{"type":"print","value":"0921-0296"},{"type":"electronic","value":"1573-0409"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}