Normal view MARC view ISBD view

Implementation of laser simulator in robot path determination [electronic resource] / Zenas Chung Han Yuan

By:

Chung, Zenas Han Yuan

Material type:

Computer filePublication details: Kuantan, Pahang : UMP, 2016Description: 1 computer disc : digital data ; 12 cmISBN:

THE0005062(Local)

Subject(s):

Online resources:

Access in library only

Dissertation note: Project Paper (Bachelor of Mechatronics Engineering (Hons.)) -- Universiti Malaysia Pahang – 2016 Abstract: The 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.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 1 )
Title notes ( 5 )

Holdings
Item type	Current library	Call number	Copy number	Status	Date due	Barcode
Final Year Report	UMPLIB PEKAN	FKP .C48 2016 r Bc. \| CD 10389 (Browse shelf(Opens below))	1	Not for loan		0000115904

Faculty of Manufacturing Engineering

Theses Gred A

Project Paper (Bachelor of Mechatronics Engineering (Hons.)) -- Universiti Malaysia Pahang – 2016

The 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.

Item in pdf format