{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T14:48:45Z","timestamp":1749221325141},"reference-count":12,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2009,3,9]],"date-time":"2009-03-09T00:00:00Z","timestamp":1236556800000},"content-version":"unspecified","delay-in-days":6217,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Robotica"],"published-print":{"date-parts":[[1992,3]]},"abstract":"<jats:title>SUMMARY<\/jats:title><jats:p>The paper describes a free space modeling method by multivalue coding. Each code defines some numerical values representing a set of cells from a grid. The idea consists in using the grid as a Karnaugh board whose rows and columns are binary coded rather than Gray coded. This operating method allows to define, for each code, its grid location and allows numerical comparison in order to locate a code relatively to another. This aspect is helpful for path planning. The free space model is represented by a switching function or a tree to which boolean algebra rules and mathematic operations are applied. We describe an application to mobile robot path planning.<\/jats:p>","DOI":"10.1017\/s0263574700007542","type":"journal-article","created":{"date-parts":[[2009,3,10]],"date-time":"2009-03-10T09:18:18Z","timestamp":1236676698000},"page":"125-133","source":"Crossref","is-referenced-by-count":16,"title":["Multivalue coding: application to autonomous robots"],"prefix":"10.1017","volume":"10","author":[{"given":"A.","family":"Pruski","sequence":"first","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2009,3,9]]},"reference":[{"key":"S0263574700007542_ref006","doi-asserted-by":"publisher","DOI":"10.1016\/0146-664X(80)90118-5"},{"key":"S0263574700007542_ref012","unstructured":"12. Pruski A. , \u201cMultivalue Coding. Application to Autonomous Robot path planning with rotations\u201d Proc of the IEEE Conf. on Robotics and Automation Sacramento, USA (1991) pp. 694\u2013699."},{"key":"S0263574700007542_ref008","doi-asserted-by":"publisher","DOI":"10.1145\/359156.359164"},{"key":"S0263574700007542_ref010","volume-title":"Principles of Artificial Intelligence","author":"Nilsson","year":"1980"},{"key":"S0263574700007542_ref005","doi-asserted-by":"publisher","DOI":"10.1109\/JRA.1987.1087080"},{"key":"S0263574700007542_ref001","first-page":"190","article-title":"Solving the find path problem by good representation of free space","volume":"13","author":"Brooks","year":"1983","journal-title":"IEEE Trans"},{"key":"S0263574700007542_ref004","first-page":"227","volume-title":"Proc of the IFAC-INCOM'89","author":"Pruski","year":"1989"},{"key":"S0263574700007542_ref002","first-page":"263","article-title":"Structuring free space as an Hypergraph for roving robot path planning and navigation","volume":"9","author":"Rueb","year":"1987","journal-title":"IEEE Trans"},{"key":"S0263574700007542_ref003","unstructured":"3. Chatilla R. , \u201cSyst\u00e8me de navigation pour robot mobile autonome: mod\u00e9lisation et processus de d\u00e9cision\u201d Th\u00e8se de DDI, Toulouse (1981)."},{"key":"S0263574700007542_ref007","doi-asserted-by":"publisher","DOI":"10.1016\/0146-664X(82)90098-3"},{"key":"S0263574700007542_ref009","first-page":"1326","article-title":"Efficients algorithms for planning purely translational collision-free motion and three dimensions","author":"Sharir","year":"1987","journal-title":"IEEE Proc. of the IEEE Cond. on Robotics and Automation"},{"key":"S0263574700007542_ref011","unstructured":"11. Pruski A. , \u201cMultirobot path planning among moving obstacles using multivalue codes\u201d Proc of the IEEE Conf. on CIM Troy, USA (1990) pp. 588\u2013592."}],"container-title":["Robotica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0263574700007542","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T18:22:50Z","timestamp":1558030970000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0263574700007542\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,3]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,3]]}},"alternative-id":["S0263574700007542"],"URL":"https:\/\/doi.org\/10.1017\/s0263574700007542","relation":{},"ISSN":["0263-5747","1469-8668"],"issn-type":[{"value":"0263-5747","type":"print"},{"value":"1469-8668","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,3]]}}}