{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T15:16:20Z","timestamp":1730301380168,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,26]],"date-time":"2021-07-26T00:00:00Z","timestamp":1627257600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,7,26]],"date-time":"2021-07-26T00:00:00Z","timestamp":1627257600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,26]],"date-time":"2021-07-26T00:00:00Z","timestamp":1627257600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,26]]},"DOI":"10.1109\/tsp52935.2021.9522682","type":"proceedings-article","created":{"date-parts":[[2021,8,30]],"date-time":"2021-08-30T19:12:50Z","timestamp":1630350770000},"page":"52-57","source":"Crossref","is-referenced-by-count":2,"title":["A Collision-Free Path Planning Algorithm for Non-Complex ASRS Using Heuristic Functions"],"prefix":"10.1109","author":[{"given":"Pierre E.","family":"Abi-Char","sequence":"first","affiliation":[]},{"given":"Chadi","family":"Riman","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICSIGSYS.2019.8811093"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2018.07.056"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TMECH.2004.823875"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TMECH.2006.886255"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2014.6907764"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2009.2016350"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CCDC.2017.7978471"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2014.2316638"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1514095.1514127"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1090\/qam\/102435"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1287\/opre.17.3.395"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","article-title":"A formal basis for the heuristic determination of minimum cost paths","volume":"4","author":"peter","year":"1968","journal-title":"IEEE Transactions on Systems Science and Cybernetics"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISAI.2016.0086"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/IACS.2016.7476100"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/IMCEC46724.2019.8983841"}],"event":{"name":"2021 44th International Conference on Telecommunications and Signal Processing (TSP)","start":{"date-parts":[[2021,7,26]]},"location":"Brno, Czech Republic","end":{"date-parts":[[2021,7,28]]}},"container-title":["2021 44th International Conference on Telecommunications and Signal Processing (TSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9522010\/9522587\/09522682.pdf?arnumber=9522682","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T11:45:21Z","timestamp":1652183121000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9522682\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,26]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/tsp52935.2021.9522682","relation":{},"subject":[],"published":{"date-parts":[[2021,7,26]]}}}