國立虎尾科技大學 |

Design of a Pick-and-Place Robot With Computer Vision and Optimized Sorting Algorithms.

Record Type:	Language materials, manuscript : Monograph/item
Title/Author:	Design of a Pick-and-Place Robot With Computer Vision and Optimized Sorting Algorithms./
Author:	Kilula, Dan.
Description:	1 online resource (106 pages)
Notes:	Source: Masters Abstracts International, Volume: 85-12.
Contained By:	Masters Abstracts International85-12.
Subject:	Mechanical engineering. -
Online resource:	click for full text (PQDT)
ISBN:	9798383165911

Design of a Pick-and-Place Robot With Computer Vision and Optimized Sorting Algorithms.
Kilula, Dan.

Design of a Pick-and-Place Robot With Computer Vision and Optimized Sorting Algorithms. - 1 online resource (106 pages)

Source: Masters Abstracts International, Volume: 85-12.

Thesis (M.S.)--Arkansas State University, 2024.

Includes bibliographical references

In computer science, the Multiple Travelling Salesman Problem (mTSP) is a special case of Travelling Salesmen where one salesman travels through a network of cities (end nodes) and goes back to the starting city (start node) rather than stopping at the targeted end node. Numerous search and optimization algorithms are used to find the most time-efficient path for the salesman to visit each node. In this work 3 optimization methods and algorithms such as linear programming and A* pathfinding are utilized and compared to solve the mTSP applied to a 3 degrees-of-freedom pick-and-place robot that uses computer vision to detect and sort objects on a 2D workspace. Simulation results suggest that the A* pathfinding algorithm, which is a special case of dynamic programming, will most of the time provide better performance compared to other optimization methods such as divide and conquer or linear programming.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2024

Mode of access: World Wide Web

ISBN: 9798383165911Subjects--Topical Terms:

557493
Mechanical engineering.
Subjects--Index Terms:

A* pathfinding algorithmIndex Terms--Genre/Form:

554714
Electronic books.

Design of a Pick-and-Place Robot With Computer Vision and Optimized Sorting Algorithms.
LDR:02377ntm a22004217 4500 001 1150136
005 20241022111555.5
006 m o d
007 cr bn ---uuuuu
008 250605s2024 xx obm 000 0 eng d
020 $a 9798383165911
035 $a (MiAaPQ)AAI30990801
035 $a AAI30990801
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a Kilula, Dan. $3 1476567
245 1 0 $a Design of a Pick-and-Place Robot With Computer Vision and Optimized Sorting Algorithms.
264 0 $c 2024
300 $a 1 online resource (106 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Masters Abstracts International, Volume: 85-12.
500 $a Advisor: Haran, Shivan;Seok, Ilwoo.
502 $a Thesis (M.S.)--Arkansas State University, 2024.
504 $a Includes bibliographical references
520 $a In computer science, the Multiple Travelling Salesman Problem (mTSP) is a special case of Travelling Salesmen where one salesman travels through a network of cities (end nodes) and goes back to the starting city (start node) rather than stopping at the targeted end node. Numerous search and optimization algorithms are used to find the most time-efficient path for the salesman to visit each node. In this work 3 optimization methods and algorithms such as linear programming and A* pathfinding are utilized and compared to solve the mTSP applied to a 3 degrees-of-freedom pick-and-place robot that uses computer vision to detect and sort objects on a 2D workspace. Simulation results suggest that the A* pathfinding algorithm, which is a special case of dynamic programming, will most of the time provide better performance compared to other optimization methods such as divide and conquer or linear programming.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2024
538 $a Mode of access: World Wide Web
650 4 $a Mechanical engineering. $3 557493
650 4 $a Computer science. $3 573171
650 4 $a Robotics. $3 561941
653 $a A* pathfinding algorithm
653 $a Computer vision
653 $a Dynamic programming
653 $a Linear programming
653 $a Multiple Travelling Salesman Problem
653 $a Pick-and-place robot
655 7 $a Electronic books. $2 local $3 554714
690 $a 0548
690 $a 0984
690 $a 0771
690 $a 0800
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a Arkansas State University. $b Engineering. $3 1476568
773 0 $t Masters Abstracts International $g 85-12.
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=30990801 $z click for full text (PQDT)