| 000 | 02836nmm a2200313 a 4500 | ||
|---|---|---|---|
| 001 | vtls000098369 | ||
| 003 | KUKTEM | ||
| 005 | 20251117113324.0 | ||
| 008 | 161209s2016 my fq d 001 0 eng d | ||
| 020 | _aTHE0005062(Local) | ||
| 039 | 9 |
_a201905101509 _bhanafiah _c201712081549 _dsaini _y201612091105 _zsaini |
|
| 040 | _aUMP | ||
| 090 | _aFKP .C48 2016 r Bc. | ||
| 090 | _aCD 10389 | ||
| 100 | 1 | _aChung, Zenas Han Yuan | |
| 245 | 1 | 0 |
_aImplementation of laser simulator in robot path determination _h[electronic resource] / _cZenas Chung Han Yuan |
| 260 |
_aKuantan, Pahang : _bUMP, _c2016 |
||
| 300 |
_a1 computer disc : _bdigital data ; _c12 cm. |
||
| 500 | _aFaculty of Manufacturing Engineering | ||
| 500 | _aTheses Gred A | ||
| 502 | _aProject Paper (Bachelor of Mechatronics Engineering (Hons.)) -- Universiti Malaysia Pahang – 2016 | ||
| 520 | 3 | _aThe most important aspect for autonomous mobile robot to achieve its tasks is path planning. The path planning of autonomous robot is used to search a collision free path that a robot must take in order to pass over each point in an environment. The path is a plan of geometric locus points in a given space and the robot has to pass through it. In this research, the laser simulator search graph is a novel path planning approach which is proposed by Mohhammed A.H.Ali and the working principle of this approach is that the laser simulator is model as principle of real laser range finder. The environment of the robot is assume to be captured by camera and the laser range finder is used to measure the distance between robot and border. By using the measurement of distances, point in front of robot can be generated and this process repeat until the robot reach goal position. The developed laser simulator is then implemented by testing its performance in few different environments. In addition, one of the classical path planning approach which is A* algorithm will be used to compare the result generated by laser simulator. From this research, the laser simulator has advantages in computational time and low collision possibility compare with A* algorithm while the path cost of laser simulator is always greater than path cost of A* algorithm. Dari kajian ini, simulator laser mempunyai kelebihan dalam masa pengiraan dan kemungkinan perlanggaran rendah berbanding dengan A* algorithm manakala kos jalan laser simulator sentiasa lebih besar daripada kos jalan A* algorithm. | |
| 538 | _aItem in pdf format | ||
| 610 | 2 | 0 |
_aFaculty of Manufacturing Engineering _xDissertations |
| 650 | 0 |
_aUniversities and Colleges _xDissertations |
|
| 650 | 0 | _aTheses | |
| 856 | 4 | 0 |
_uhttp://ecollib.ump.edu.my/id/eprint/3995 _zAccess in library only |
| 999 |
_aVIRTUA40 _c6720 _d6726 |
||
| 999 | _aVTLSSORT0080*0200*0400*0900*0901*1000*2450*2600*3000*5000*5001*5020*5200*5380*6100*6500*6501*8560*9992 | ||