Logo
Please use this identifier to cite or link to this item: https://irju.jdvu.ac.in/jspui/handle/123456789/10736
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorRakshit, Pratyusha-
dc.contributor.authorDas, Kaustav-
dc.date.accessioned2026-11-02T10:21:28Z-
dc.date.available2026-11-02T10:21:28Z-
dc.date.issued2024-
dc.date.submitted2024-
dc.identifier.otherDC5361-
dc.identifier.urihttps://irju.jdvu.ac.in/jspui/handle/123456789/10736-
dc.description.abstractCoordination of multiple agents is an active research area in robotics and automation. The multi-robot box pushing problem studied in this work is a common multi-agent coordination scenario. In the classic two-robot box-pushing problem, two identical robots push a box over a confined workspace with one or more static obstacles so that the task is completed as quickly as possible. A local trajectory must be planned by moving from a predefined starting position to a fixed target position. If possible, it will require time and minimal energy input. In this work, the problem is a multi-objective one with the goal of minimizing a total of four objectives, including (i) total time, (ii) total energy, and (iii) Euclidean distance from the current box position to that box position. It is formulated in an optimization framework target, and (iv) the penalty imposed if the box collides with an obstacle.en_US
dc.format.extent[vi], 63p.en_US
dc.language.isoenen_US
dc.publisherJadavpur University, Kolkata, West Bengalen_US
dc.subjectEvolutionary Computationen_US
dc.subjectOptimization Algorithmsen_US
dc.subjectDifferential Evolution Multi-Criteria Decision Making (VIKOR)en_US
dc.titleMulti robot box pushing using VIKOR induced differential evolution algorithmen_US
dc.typeTexten_US
dc.departmentJadavpur University. Department of Electronics and Telecommunications Engineeringen_US
Appears in Collections:Dissertations

Files in This Item:
File Description SizeFormat 
M.E. (Electronics Tele - communication Engineering) Kaustav Das.pdf2.17 MBAdobe PDFView/Open


Items in IR@JU are protected by copyright, with all rights reserved, unless otherwise indicated.