{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,28]],"date-time":"2026-07-28T10:43:16Z","timestamp":1785235396439,"version":"3.55.0"},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"5","license":[{"start":{"date-parts":[[1998,9,1]],"date-time":"1998-09-01T00:00:00Z","timestamp":904608000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Robotica"],"published-print":{"date-parts":[[1998,9]]},"abstract":"<jats:p>A genetic algorithm for the path planning problem of a mobile robot which is moving and picking up loads on its way is presented. Assuming a findpath problem in a graph, the proposed algorithm determines a near-optimal path solution using a bit-string encoding of selected graph vertices. Several simulation results of specific task-oriented variants of the basic path planning problem using the proposed genetic algorithm are provided. The results \nobtained are compared with ones yielded by hill-climbing and simulated annealing techniques, showing a higher or at least equally well performance for the genetic algorithm.<\/jats:p>","DOI":"10.1017\/s0263574798000289","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T09:39:16Z","timestamp":1027762756000},"page":"575-588","source":"Crossref","is-referenced-by-count":55,"title":["Path planning of a mobile robot using genetic heuristics"],"prefix":"10.1017","volume":"16","author":[{"given":"Andreas C.","family":"Nearchou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[1998,9,1]]},"container-title":["Robotica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0263574798000289","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T16:19:41Z","timestamp":1557505181000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0263574798000289\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,9]]},"references-count":0,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1998,9]]}},"alternative-id":["S0263574798000289"],"URL":"https:\/\/doi.org\/10.1017\/s0263574798000289","relation":{},"ISSN":["0263-5747","1469-8668"],"issn-type":[{"value":"0263-5747","type":"print"},{"value":"1469-8668","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,9]]}}}