Kuffner, J. and Nishiwaki, K. and Kagami, S. and Inaba, M. and Inoue, H. (2001), "Footstep planning among obstacles for biped robots", Proc. of 2001 IEEE Intl. Conf. on Intelligent Robots and Systems (IROS 2001)External link in |title= (help)CS1 maint: multiple names: authors list (link)
Kavraki, L. E.; Svestka, P.; Latombe, J.-C.; Overmars, M. H. (1996), "Probabilistic roadmaps for path planning in high-dimensional configuration spaces", IEEE Transactions on Robotics and Automation, 12 (4): 566–580, doi:10.1109/70.508439 External link in |title= (help).
Bohlin, R. and Kavraki, LE (2000), "Path planning using lazy PRM", IEEE International Conference on Robotics and Automation, 2000. Proceedings. ICRA'00External link in |title= (help)CS1 maint: multiple names: authors list (link)
Lavalle, S.M. (1998). "Rapidly-exploring random trees: A new tool for path planning". Computer Science Dept, Iowa State University, Tech. Rep. TR: 98–11. สืบค้นเมื่อ 2008-06-30.
Planning Algorithms โดย Steven M. LaValle สำนักพิมพ์ Cambridge University Press (ISBN 0-521-86205-1)
Principles of Robot Motion: Theory, Algorithms, and Implementation โดย H. Choset, W. Burgard, S. Hutchinson, G. Kantor, L. E. Kavraki, K. Lynch, และ S. Thrun สำนักพิมพ์ MIT Press จัดพิมพ์เมื่อ เมษายน ค.ศ. 2005
การวางแผนการเคล, อนท, งกฤษ, motion, planning, เป, นคำท, ใช, ในว, ทยาการห, นยนต, โดยม, ความสำค, ญต, อการพ, ฒนาห, นยนต, ตโนม, เป, นอย, างมาก, วอย, างของได, แก, ในกรณ, ของห, นยนต, เคล, อนท, ได, mobile, robot, เม, อได, บคำส, งให, เด, นทางจากห, องหน, งไปย, งห, องถ,. karwangaephnkarekhluxnthi xngkvs motion planning epnkhathiichinwithyakarhunynt odymikhwamsakhytxkarphthnahunyntxtonmtiepnxyangmak twxyangkhxngkarwangaephnkarekhluxnthiidaek inkrnikhxnghunyntekhluxnthiid mobile robot emuxidrbkhasngihedinthangcakhxnghnungipynghxngthdipinxakharsankngan hunyntcamiwithikaredinthangxyangirephuxipthungcudhmayodyimchnkbsingkidkhwang aelaimtkbnid epntn inkrnikhxngaekhnkl robot arm thiichinxutsahkrrm karwangaephnkarekhluxnthixacsnicwaaetlakhxtx joint caekhluxnihwxyangirephuxiphyibcbwtthu aelainkrnikhxnghunynthiwaemnnxyd hunyntcathaxyangirephuxkmekbkhxngthixyuitota hruxcakawedinxyangir footstep planning 1 odyimihehyiybsingkidkhwangthiphun epntntwxyangkhxngphunthingan workspace enuxha 1 hlkkar 1 1 priphumiokhrngaebb 1 2 priphumiwang 2 khntxnwithi 3 karprayuktichngan 4 duephim 5 xangxing 6 aehlngkhxmulxunhlkkar aekikh priphumiokhrngaebbkhxnghunyntthimikhnadepncud ody sikhaw Cfree aelasietha Cobs priphumiokhrngaebbkhxnghunynthimiruprangsiehliymekhluxnthiodykareluxntaaehnng siaednginrup ody sikhaw Cfree aelasietha Cobs siethaekhm singkidkhwang siethaxxn okhrngaebbthihunyntekidkarsmphshruxchnsingkidkhwanghruxxxkcakphunthingan twxyangkhxngesnthangedinthidi twxyangkhxngesnthangedinthiimdi twxyangkhxng road map pyhaphunthankhxngkarwangaephnkarekhluxnthikhuxkarsrangkarekhluxnihwxyangtxenuxngtngaetcuderimtnipyngcudepahmayodyimchnsingkidkhwang obstacle ody n taaehnngerimtn thathanghruxokhrngaebb configuration khxnghunyntmkekhiynaethndwy S starting configuration inkhnathiokhrngaebbepahmaynnaethndwy G goal configuration pyhakarwangaephnkarekhluxnthikhxnghunyntthingaythisud khuxkrnithrabtaaehnngkhxngsingkidkhwangxyuaetaerk odypkti erkhakhnitkhxnghunyntaelasingkidkhwangxyuinpriphumi 2 miti hrux 3 miti thieraeriykwa phunthingan workspace xyangirktamesnthang path karekhluxnthikhxnghunyntcathukxthibayinpriphumiokhrngaebb configuration space sungodypktiepnpriphumisung priphumiokhrngaebb aekikh thathanghnung pose khxnghunyntthukeriykwaepn okhrngaebb configuration khxnghunynt estkhxngokhrngaebbthiepnipidthnghmderiykwa priphumiokhrngaebb configuration space aelamkniymekhiynaethndwyest C yktwxyangechn smmtihunyntmikhnadepnephiyngcud immikhnad ekhluxnthibnphunthinganthiepnranab 2 miti inkrninipriphumiokhrngaebb C khuxranab aelaokhrngaebbkhxnghunyntsamarthekhiynxthibayiddwypharamietxr 2 khakhux x y thahunyntmiruprangephiyng 2 mitithisamartheluxntaaehnngaelahmunid phunthinganinkrninicayngkhngepn 2 miti aetpriphumiokhrngaebb C caepnyukhliediynkrupaebbphiess special Euclidean group SE 2 R2 displaystyle times SO 2 odythi SO 2 epn special orthogonal group khxngkarhmunin 2 miti aelaokhrngaebbinkrninisamarthxthibayiddwypharamietxr 3 kha idaek x y 8 thahunyntmiruprangephiyng 2 mitithisamartheluxntaaehnngaelahmunid phunthinganinkrninicaepn 3 miti aetpriphumiokhrngaebb C caepnyukhliediynkrupaebbphiess special Euclidean group SE 3 R3 displaystyle times SO 3 aelaokhrngaebbinkrninisamarthxthibayiddwypharamietxr 6 kha idaek x y z sahrbkareluxntaaehnng aela mumxxyelxr Euler angles a b g thahunyntepnhunyntaebbaekhnklyudtidxyukbthi aelamikhxtxcanwn N priphumiokhrngaebb C inkrninicaepnpriphumi N mitipriphumiwang aekikh estkhxngpriphumiokhrngaebbthiimekidkarchnknkbsingkidkhwang eriykwa priphumiwang free space ekhiynaethndwy Cfree swnetimetmkhxng Cfree inpriphumiokhrngaebb C eriykwa obstacle region hrux forbidden region ekhiynaethndwy Cobsodypktikarkhanwnha Cfree xyutrngihninphunthinganbangthaidyakmak xyangirktampccubnnikarthdsxbwaokhrngaebbkhxnghunyntxyuin Cfree hruxim samarththaidodykhxnkhangmiprasiththiphaph klawkhuxerimtncakkarich forward kinematics ephuxhataaehnngthangerkhakhnitkhxnghunynt caknnichkarthdsxbkarchnkn collision detection ephuxthdsxbwahunyntchnkbsingkidkhwanghruximkhntxnwithi aekikhGrid Based Search Geometric Algorithms Visibility Graph Cell Decomposition Potential Fields Sampling Based Algorithms Probabilistic Roadmap PRM 2 Lazy PRM 3 Rapidly exploring random tree RRT 4 karprayuktichngan aekikhkarekhluxnthikhxnghunynt Robot navigation rabbxtonmti Automation rthirkhnkhb Driverless car hunyntslykrrm Robotic surgery aexniemchn protein foldingduephim aekikhkinodynamic planningxangxing aekikh Kuffner J and Nishiwaki K and Kagami S and Inaba M and Inoue H 2001 Footstep planning among obstacles for biped robots Proc of 2001 IEEE Intl Conf on Intelligent Robots and Systems IROS 2001 External link in title help CS1 maint multiple names authors list link Kavraki L E Svestka P Latombe J C Overmars M H 1996 Probabilistic roadmaps for path planning in high dimensional configuration spaces IEEE Transactions on Robotics and Automation 12 4 566 580 doi 10 1109 70 508439 External link in title help Bohlin R and Kavraki LE 2000 Path planning using lazy PRM IEEE International Conference on Robotics and Automation 2000 Proceedings ICRA 00 External link in title help CS1 maint multiple names authors list link Lavalle S M 1998 Rapidly exploring random trees A new tool for path planning Computer Science Dept Iowa State University Tech Rep TR 98 11 subkhnemux 2008 06 30 aehlngkhxmulxun aekikhRobot Motion Planning ody Jean Claude Latombe sankphimph Kluwer Academic Publishers Planning Algorithms ody Steven M LaValle sankphimph Cambridge University Press ISBN 0 521 86205 1 Principles of Robot Motion Theory Algorithms and Implementation ody H Choset W Burgard S Hutchinson G Kantor L E Kavraki K Lynch aela S Thrun sankphimph MIT Press cdphimphemux emsayn kh s 2005 bthkhwamekiywkbethkhonolyi hrux singpradisthniyngepnokhrng khunsamarthchwywikiphiediyidodyephimkhxmulekhathungcak https th wikipedia org w index php title karwangaephnkarekhluxnthi amp oldid 4701482, wikipedia, วิกิ หนังสือ, หนังสือ, ห้องสมุด,