<?xml version="1.0" encoding="UTF-8"?>
<record
    xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
    xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd"
    xmlns="http://www.loc.gov/MARC21/slim">

  <leader>02836nmm a2200313 a 4500</leader>
  <controlfield tag="001">vtls000098369</controlfield>
  <controlfield tag="003">KUKTEM</controlfield>
  <controlfield tag="005">20251117113324.0</controlfield>
  <controlfield tag="008">161209s2016    my     fq  d  001 0 eng d</controlfield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="a">THE0005062(Local)</subfield>
  </datafield>
  <datafield tag="039" ind1=" " ind2="9">
    <subfield code="a">201905101509</subfield>
    <subfield code="b">hanafiah</subfield>
    <subfield code="c">201712081549</subfield>
    <subfield code="d">saini</subfield>
    <subfield code="y">201612091105</subfield>
    <subfield code="z">saini</subfield>
  </datafield>
  <datafield tag="040" ind1=" " ind2=" ">
    <subfield code="a">UMP</subfield>
  </datafield>
  <datafield tag="090" ind1=" " ind2=" ">
    <subfield code="a">FKP .C48 2016 r Bc.</subfield>
  </datafield>
  <datafield tag="090" ind1=" " ind2=" ">
    <subfield code="a">CD 10389</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
    <subfield code="a">Chung, Zenas Han Yuan</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
    <subfield code="a">Implementation of laser simulator in robot path determination</subfield>
    <subfield code="h">[electronic resource] /</subfield>
    <subfield code="c">Zenas Chung Han Yuan</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="a">Kuantan, Pahang :</subfield>
    <subfield code="b">UMP,</subfield>
    <subfield code="c">2016</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">1 computer disc :</subfield>
    <subfield code="b">digital data ;</subfield>
    <subfield code="c">12 cm.</subfield>
  </datafield>
  <datafield tag="500" ind1=" " ind2=" ">
    <subfield code="a">Faculty of Manufacturing Engineering</subfield>
  </datafield>
  <datafield tag="500" ind1=" " ind2=" ">
    <subfield code="a">Theses Gred A</subfield>
  </datafield>
  <datafield tag="502" ind1=" " ind2=" ">
    <subfield code="a">Project Paper (Bachelor of Mechatronics Engineering (Hons.)) -- Universiti Malaysia Pahang &#x2013; 2016</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
    <subfield code="a">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.</subfield>
  </datafield>
  <datafield tag="538" ind1=" " ind2=" ">
    <subfield code="a">Item in pdf format</subfield>
  </datafield>
  <datafield tag="610" ind1="2" ind2="0">
    <subfield code="a">Faculty of Manufacturing Engineering</subfield>
    <subfield code="x">Dissertations</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Universities and Colleges</subfield>
    <subfield code="x">Dissertations</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Theses</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
    <subfield code="u">http://ecollib.ump.edu.my/id/eprint/3995</subfield>
    <subfield code="z">Access in library only</subfield>
  </datafield>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="0">0</subfield>
    <subfield code="1">0</subfield>
    <subfield code="4">0</subfield>
    <subfield code="7">1</subfield>
    <subfield code="a">20000</subfield>
    <subfield code="b">20000</subfield>
    <subfield code="d">2019-09-04</subfield>
    <subfield code="l">0</subfield>
    <subfield code="o">FKP .C48 2016 r Bc. | CD 10389</subfield>
    <subfield code="p">0000115904</subfield>
    <subfield code="r">2019-09-04 00:00:00</subfield>
    <subfield code="t">1</subfield>
    <subfield code="w">2019-09-04</subfield>
    <subfield code="y">PSM</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="a">VIRTUA40</subfield>
    <subfield code="c">6720</subfield>
    <subfield code="d">6726</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="a">VTLSSORT0080*0200*0400*0900*0901*1000*2450*2600*3000*5000*5001*5020*5200*5380*6100*6500*6501*8560*9992</subfield>
  </datafield>
</record>
