Please use this identifier to cite or link to this item:
http://hdl.handle.net/10603/300933
Title: | Study on Trust based Cooperative Navigation Planning in Multi Robot System |
Researcher: | Rao D.C. |
Guide(s): | Manas Ranjan Kabat |
Keywords: | Engineering and Technology,Computer Science,Robotics |
University: | Veer Surendra Sai University of Technology |
Completed Date: | |
Abstract: | The untiring endeavour of scientiand#64257;c community has made the robots enable in newlineresolving issues related to the society in many precarious situations. The task newlinesolving aptitude of robots has made them viable in industrial sectors to accom- newlineplish the task as assigned. The robots are placed in the environment comprising newlineof both stationary and moving obstacles. The robot navigates from its predeand#64257;ned newlinestarting positions to the designed goal positions to perform the desired tasks as newlineassigned by the end-user. Safe navigation in addition to attain shortest path is newlineof prime concern in the problem of interest. Signiand#64257;cant eand#64256;ort has been made newlinein the early research work to make robot intelligent via several algorithms to newlineaddress the concern. The proposed algorithms do not substantiate solutions of newlineinterest in case of multi-robot path planning. Furthermore, the inevitability of newlineachieving path smoothness as well as minimizing energy requirement has made newlinethe present problem more complex. Therefore, there is a need of searching some newlinecomputationally stable algorithms that can provide the desired solutions with less newlinecomputational burden. The emerging of meta-heuristic approaches has made pos- newlinesible of solving numerous complex engineering optimization problem because of newlinesome positive attributes such as: 1. Simple; 2. Easy to implement; 3. Robust; newlineand 4. Computationally stable. The need of the present scenario is to and#64257;gure newlineout some meta-heuristic approaches whose architecture resembles the multi robot newlinepath planning problem. The present thesis has and#64257;gured out two meta-heuristic newlineapproaches to get the desired solutions by minimizing the objective function. The newlineproposed approaches are developed to deal with the environment comprising of newlinestationary and moving obstacles.The environment designed with multi-robots newlinecontaining static obstacles is and#64257;rst studied. The objective function is formulated as newlinea weighted sum of cost, smoothness, and safety of the path. The improved version newlineof Krill Herd algorithm (IKH) is then employed to minimize the object |
Pagination: | 203 p. |
URI: | http://hdl.handle.net/10603/300933 |
Appears in Departments: | Department of Computer Science and Engineering and IT |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
01_title.pdf | Attached File | 129.25 kB | Adobe PDF | View/Open |
02_certificate.pdf | 160.28 kB | Adobe PDF | View/Open | |
03_acknowlegdement.pdf | 68.93 kB | Adobe PDF | View/Open | |
04_contents.pdf | 106.15 kB | Adobe PDF | View/Open | |
05_abstract.pdf | 78.16 kB | Adobe PDF | View/Open | |
06_list of figures and tables.pdf | 135.5 kB | Adobe PDF | View/Open | |
07_chapter 1.pdf | 661.73 kB | Adobe PDF | View/Open | |
08_chapter 2.pdf | 1.14 MB | Adobe PDF | View/Open | |
09_chapter 3.pdf | 8.19 MB | Adobe PDF | View/Open | |
10_chapter 4.pdf | 2.46 MB | Adobe PDF | View/Open | |
11_chapter 5.pdf | 9.15 MB | Adobe PDF | View/Open | |
12_chapter 6.pdf | 4.88 MB | Adobe PDF | View/Open | |
13_chapter 7.pdf | 94.78 kB | Adobe PDF | View/Open | |
14_bibliography.pdf | 173.35 kB | Adobe PDF | View/Open |
Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).
Altmetric Badge: