21 0

Full metadata record

DC FieldValueLanguage
dc.contributor.author임준홍-
dc.date.accessioned2019-08-12T06:18:44Z-
dc.date.available2019-08-12T06:18:44Z-
dc.date.issued2006-09-
dc.identifier.citationInternational Conference on Natural Computation; ICNC 2006: Advances in Natural Computation, Page. 801-804en_US
dc.identifier.isbn978-3-540-45907-1-
dc.identifier.urihttps://link.springer.com/chapter/10.1007/11881223_102-
dc.identifier.urihttp://repository.hanyang.ac.kr/handle/20.500.11754/108489-
dc.description.abstractMany researches on path planning and obstacle avoidance for the fundamentals of mobile robot have been done. Although many solutions help finding a optimal path, those can be applied to real world only under constrained condition, which means that it is difficult to find a universal algorithm. Moreover, a complicated computation to obtain an optimal path induces the time delay so that a robot can not avoid moving obstacles. In this paper, we propose the algorithm of path planning and obstacle avoidance using Random Access Sequence(RAS) methodology. In the proposed scheme, the cell decomposition is make first and cell neighbors are assigned as sequence code, then the path with minimum length is selected.en_US
dc.language.isoen_USen_US
dc.publisherSPRINGER-VERLAG BERLINen_US
dc.titleReal-Time Path Planning Strategies for Real World Application using Random Access Sequenceen_US
dc.typeArticleen_US
dc.identifier.doi10.1007/11881223_102-
dc.relation.journalLECTURE NOTES IN COMPUTER SCIENCE-
dc.contributor.googleauthorKwak, Jaehyuk-
dc.contributor.googleauthorLim, Joonhong-
dc.relation.code2007206327-
dc.sector.campusE-
dc.sector.daehakCOLLEGE OF ENGINEERING SCIENCES[E]-
dc.sector.departmentDIVISION OF ELECTRICAL ENGINEERING-
dc.identifier.pidjhlim-
Appears in Collections:
COLLEGE OF ENGINEERING SCIENCES[E](공학대학) > ELECTRICAL ENGINEERING(전자공학부) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE