{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T22:07:57Z","timestamp":1648764477395},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,3,1]],"date-time":"2013-03-01T00:00:00Z","timestamp":1362096000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Elektrotech. Inftech."],"published-print":{"date-parts":[[2013,3]]},"DOI":"10.1007\/s00502-013-0132-6","type":"journal-article","created":{"date-parts":[[2013,3,14]],"date-time":"2013-03-14T03:07:16Z","timestamp":1363230436000},"page":"54-60","source":"Crossref","is-referenced-by-count":1,"title":["Two new heuristic approaches for optimal path calculation on occupancy grid map"],"prefix":"10.1007","volume":"130","author":[{"given":"Artan","family":"Dermaku","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xhevahir","family":"Bajrami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,3,15]]},"reference":[{"key":"132_CR1","first-page":"1","volume-title":"Proceedings of the 7th Mexican international conference on artificial intelligence MICAI\u201908","author":"A. Dermaku","year":"2007","unstructured":"Dermaku, A., Ganzow, T., Gottlob, G., McMahan, B., Musliu, N., Samer, M. (2007): Heuristic methods for hypertree decomposition. In Proceedings of the 7th Mexican international conference on artificial intelligence MICAI\u201908, Mexico (pp. 1\u201311)."},{"key":"132_CR2","volume-title":"PODS\u2019 99 proceedings of the eighteenth ACM symposium on principle of database systems","author":"G. Gottlob","year":"1999","unstructured":"Gottlob, G., Leone, N., Scarcello, F. (1999): Hypertree decomposition and tractable queries. In PODS\u2019 99 proceedings of the eighteenth ACM symposium on principle of database systems."},{"key":"132_CR3","unstructured":"Jeavons, P., Cohen, D., Gysens, M. (1991): A structural decomposition of hypergraphs. Mathematics subject classification."},{"key":"132_CR4","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. Norwood: Kluwer Academic."},{"key":"132_CR5","volume-title":"Introduction to autonomous mobile robots","author":"R. Siegwart","year":"2004","unstructured":"Siegwart, R., Nourbakhsh, I. R. (2004): Introduction to autonomous mobile robots. Cambridge: A Bredford Book."}],"container-title":["e & i Elektrotechnik und Informationstechnik"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00502-013-0132-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00502-013-0132-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00502-013-0132-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T21:48:36Z","timestamp":1559080116000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00502-013-0132-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["132"],"URL":"https:\/\/doi.org\/10.1007\/s00502-013-0132-6","relation":{},"ISSN":["0932-383X","1613-7620"],"issn-type":[{"value":"0932-383X","type":"print"},{"value":"1613-7620","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3]]}}}