Robotic Motion Planning in Dynamic Environments and its Applications
(1) * M. G. Mohanan Mail (University of Mumbai, India)
(2) Ambuja Salgaonkar Mail (University of Mumbai, India)
*corresponding author

Abstract


The fundamental problem of robot motion planning in a dynamic environment (RMPDE) is to find an optimal collision-free path from the start to the goal in a dynamic environment. Our literature survey of over 100 papers from the last four decades reveals that there are more than 30 models of RMPDE, and there is no benchmarking criterion to select one that is the best in a given situation. In this context, generating a regression-based model with 10 attributes is the first and foremost contribution of our research. Given a highly human-interactive environment like a cafeteria or a bus stand, the gross hidden Markov model has special importance for modeling a robot path. A variant of the growing hidden Markov model for a serving robot in a cafeteria is the second contribution of this paper. We simulated the behavior of GHMM in a cafeteria with static and dynamic obstacles (static obstacles were both convex and concave) and with three different arrangements of the tables and obstacles. Robots have been employed in mushroom harvesting. A novel proposition discussed in this paper is probabilistic road map planning for a robot that finds an optimum path for reaching the ripened mushrooms in a randomly planted mushroom farm and a dexterous hand to pluck the selected mushrooms by employing inverse kinematics. Further, two biologically inspired meta-heuristic algorithms, ant colony optimization, and firefly has been studied for their application to latex collection. The simulation results with this environment show that the firefly algorithm outperforms ant colony optimization in the general case. Finally, we have proposed a few pointers for future research in this domain.  The compilation and comparison of various approaches to robot motion planning in highly dynamic environments, and the simulation of a few models for some typical scenarios, have been the contributions of this paper.

Keywords


Motion planning; Dynamic environments; Collision avoidance; Harvesting

   

DOI

https://doi.org/10.31763/ijrcs.v2i4.816 		      

Article metrics

10.31763/ijrcs.v2i4.816 Abstract views : 1830 | PDF views : 484

   

Cite

How to cite item
   

Full Text

Download

References


[1] T. Lozano-Perez, “Spatial Planning: A Configuration Space Approach,” IEEE Transactions on Computers, vol. C-32. no. 2, 1983, https://doi.org/10.1109/TC.1983.1676196.

[2] J. F. Canny, “The Complexity of Robot Motion Planning,” Cambridge MA: MIT Press, 1988, https://books.google.co.id/books?id=_VRM_sczrKgC.

[3] K. Fujimura and H. Samet, “Planning a Time-Minimal Motion Among Moving Obstacles,” Algorithmica, vol. 10, no. 1, 1993, https://doi.org/10.1007/BF01908631.

[4] J.-C. Latombe, “Robot Motion Planning,” Kluwer Academic Publishers Boston MA, 1991, https://doi.org/10.1007/978-1-4615-4022-9.

[5] S. M. LaVall, “Planning Algorithms,” Cambridge University Press, 2006, https://doi.org/10.1017/CBO9780511546877.

[6] P. Fiorini, “Robot Motion Planning Among Moving Obstacles,” Ph.D. Thesis University of California Los Angeles, 1995, http://hdl.handle.net/2014/32127.

[7] P. Fiorini and Z. Shiller, “Robot Motion Planning in Dynamic Environments Using Velocity Obstacles,” International Journal of Robotics Research, July 1998, https://doi.org/10.1177/027836499801700706.

[8] M. G. Mohanan and A. Salgoankar, “A Survey of Robotic Motion Planning In Dynamic Environments,” Elsevier Robotics and Autonomous Systems, vol. 100, pp. 171-185, 2018, https://doi.org/10.1016/j.robot.2017.10.011.

[9] E. Owen and L. Montano, “Motion Planning in Dynamic Environments Using the Velocity Space,” IEEE/RSJ International Conference on Intelligent Robots and Systems, 2005, https://doi.org/10.1109/IROS.2005.1545110.

[10] D. Fox, W. Burgard, and S. Thrun, “The Dynamic Window Approach to Collision Avoidance,” IEEE Robotics and Automation Magazine, vol. 4, pp.23-33, 1997, https://doi.org/10.1109/100.580977.

[11] F. Large, C. Laugier, and Z. Shiller, “Navigation Among Moving Obstacles Using the NLVO: Principles and Applications to Intelligent Vehicles,” Autonomous Robots, vol. 19, no. 2, pp. 159-171, 2005, https://doi.org/10.1007/s10514-005-0610-8.

[12] F. Large, S. Shekavat, Z. Shiller, and C. Laugier, “Using Non Linear Velocity Obstacles to Plan Motion in A Dynamic Environment,” ICARCV Conference: Control Automation Robotics and Vision on 7th International Conference, vol. 2, pp. 734-739, 2022, https://ieeexplore.ieee.org/abstract/document/1238513/.

[13] S. Petti and T. Fraichard, “Safe Motion Planning in Dynamic Environments,” Proceedings of the IEEE-RSJ Int. Conf. on Intelligent Robots and Systems, pp. 2210-2215, 2005, https://doi.org/10.1109/IROS.2005.1545549.

[14] L. Martinez Gomez and T. Fraichard, “Collision Avoidance in Dynamic Environments,” ICS-Based Solution and its comparative evaluation IEEE Int. Conf. on Robotics and Automation, pp. 100-105, 2009, https://doi.org/10.1109/ROBOT.2009.5152536.

[15] O. Gal, Z. Shiller, and E. Rimon, “Efficient and Safe On-Line Motion Planning in Dynamic Environments,” IEEE on ICRA International Conference on Robotics and Automation, pp. 88-93, 2009, https://doi.org/10.1109/ROBOT.2009.5152330.

[16] Z. Shiller, O. Gal, and T. Fraichard. “The Nonlinear Velocity Obstacle Revisited: The Optimal Time Horizon,” Guaranteeing Safe Navigation in Dynamic Environments workshop, 2010, https://doi.org/10.1007/978-3-7091-0277-0_26.

[17] P. Fiorini and Z. Shiller, “Robot Motion Planning in Dynamic Environments,” The International Symposium of Robotic Research, pp. 237-248, Oct-1995, https://doi.org/10.1007/978-1-4471-1021-7_27.

[18] P. Fiorini and Z. Shiller, “Time Optimal Trajectory Planning in Dynamic Environments,” IEEE International Conference of Robotics and Automation, vol. 2, pp. 1553-1558, April 1996, https://doi.org/10.1109/ROBOT.1996.506925.

[19] O. Gal and Z. Shiller, “Mapping Obstacles to Collision States For On-Line Motion Planning In Dynamic Environments,” IEEE International Conference on Robotics And Automation, 2009, https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.186.6578&rep=rep1&type=pdf.

[20] D, Althoff, “Safety Assessment For Motion Planning In Uncertain And Dynamic Environments,” Ph.D. Thesis Technical University of Munich, 2014, https://mediatum.ub.tum.de/doc/1173997/file.pdf.

[21] N. E. Du Toit, “Robot Motion Planning in Dynamic Cluttered and Uncertain Environments: The Partially Closed-Loop Receding Horizon Control Approach,” Ph.D. Thesis California Institute of Technology, 2010, https://doi.org/10.1109/ROBOT.2010.5509278.

[22] K. Fujimura, “Motion Planning in Dynamic Environments,” Springer Science and Business Media, 2012, https://doi.org/10.1109/ROBOT.2010.5509278.

[23] M. Dorigo, T. Stiitzle, “Ant Colony Optimization,” MIT Press, 2004, https://doi.org/10.1504/IJBIC.2010.032124.

[24] X. Yang, “Firefly Algorithm Stochastic Test Functions and Design Optimisation,” Int. J. Bio‑Inspired Computation, vol. 2, no. 2, pp. 78-84, 2010, https://arxiv.org/pdf/1003.1409.pdf.

[25] X. S. Yang, Nature-inspired Metaheuristic Algorithms, Luniver Press, 2010, https://books.google.co.id/books?id=iVB_ETlh4ogC.

[26] D. Vasquez, “Incremental Learning for Motion Prediction of Pedestrians and Vehicles” Ph.D. dissertation Institut Nationale Polytechnique de Grenoble Grenoble FR, 2007, https://www.theses.fr/2007INPG0023.

[27] M. M. Gangadharan and A. Salgaonkar, “Ant Colony Optimization and firefly Algorithms for robotic Motion Planning in Dynamic Environments,” Engineering Reports, vol. 2, no. 3, 2020, https://doi.org/10.1002/eng2.12132.

[28] L. Martinez-Gomez, “Safe Navigation for Autonomous Vehicles in Dynamic Environments: An Inevitable Collision State (ICS) Perspective,” PhD Thesis Université de Grenoble, 2010, https://tel.archives-ouvertes.fr/tel-00600578/document.

[29] M. Bennewitz, “Mobile Robot Navigation in Dynamic Environments,” Ph.D Thesis University of Freiburg Germany, 2004, http://ais.informatik.uni-freiburg.de/publications/papers/thesis_bennewitz.pdf.

[30] D. Bertsekas, Dynamic Programming and Optimal Control, Athena Scientific, 2012, https://books.google.co.id/books?id=qVBEEAAAQBAJ.

[31] A. Bautin, L. Martinez-Gomez, and T. Fraichard, “Inevitable Collision States: A Probabilistic Perspective,” Proc. IEEE Int. Conf. Robotics and Automation, pp. 4022 –4027, May 2010, https://doi.org/10.1109/ROBOT.2010.5509233.

[32] R. J. Mackay, “Hidden Markov Models: Multiple Processes and Model Selection,” Ph.D. Thesis The University of British Columbia, 2003, http://hdl.handle.net/2429/16862.

[33] C. Fulgenzi, “Autonomous Navigation in Dynamic Uncertain Environment Using Probabilistic Models Of Perception And Collision Risk Prediction,” Ph.D. Thesis Institut National Polytechnique de Grenoble-INPG, 2009, https://tel.archives-ouvertes.fr/tel-00398055/.

[34] L. Montesano, J. Minguez, and L. Montano, “Modeling Dynamic Scenarios for Local Sensor-Based Motion Planning,” Autonomous Robots, vol. 25, no. 3, pp. 231-251, 2008, https://doi.org/10.1007/s10514-008-9092-9.

[35] P. Ondruska, “Learning Complex Markov Models for Mobile Robotics,” DPhil Thesis Draft St. Hilda’s College University of Oxford, July 2016, https://www.robots.ox.ac.uk/~mobile/Theses/ondruska_thesis.pdf.

[36] K. Chai Sim, “Structured Precision Matrix Modelling for Speech Recognition,” Dissertation submitted to the University of Cambridge for the degree of Doctor of Philosophy, 2006, http://mi.eng.cam.ac.uk/~mjfg/thesis_kcs23.pdf.

[37] Q. Zhu, “Hidden Markov Model for Dynamic Obstacle Avoidance of Mobile Robot Navigation,” IEEE Transactions on Robotics and Automation, vol. 7, no. 3, 1991, https://doi.org/10.1109/70.88149.

[38] T. Fraichard and H. Asama, “Inevitable Collision States: A Step Towards Safer Robots,” Advanced Robotics, vol. 18, no. 10, July 2004, https://doi.org/10.1163/1568553042674662.

[39] Z. Shiller, F. Large, S. Sekhavat, and C. Laugier, “Motion Planning in Dynamic Environments: Obstacles Moving Along Arbitrary Trajectories,” IEEE International Conference on Robotics and Automation, vol. 4, pp. 3716-3721, 2001, http://www.liralab.it/IIT_school/files/Papers/WF-05-06.pdf.

[40] A. Sud, E. Andersen, S. Curtis, M. Lin, and D. Manocha, “Real-time Path Planning for Virtual Agents In Dynamic Environments,” ACM SIGGRAPH, pp. 1-9, 2008, https://doi.org/10.1145/1401132.1401206.

[41] S. Thrun, W. Burgard, and D. Fox, “Probabilistic Robotics,” MIT Press, 2005, https://www.emerald.com/insight/content/doi/10.1108/03684920610675292/full/html.

[42] S. M. LaValle, “Rapidly-exploring Random Trees: A New Tool for Path Planning,” 2000, https://www.cs.csustan.edu/~xliang/Courses/CS4710-21S/Papers/06%20RRT.pdf.

[43] P. Svestka, “Robot Motion Planning Using Probabilistic Roadmaps,” Ph.D. Thesis Utrecht Univ,1997. https://cir.nii.ac.jp/crid/1570854176381920896.

[44] L. K. Dale, “Optimization Techniques for Probabilistic Roadmaps,” Ph.D. Thesis Texas A&M University 2000, https://www.elibrary.ru/item.asp?id=5328429.

[45] N. E. Du Toit and J. W. Burdick, “Probabilistic Collision Checking with Chance Constraints,” IEEE Transactions on Robotics, vol. 27, no. 4, Aug 2011, https://ieeexplore.ieee.org/abstract/document/5738354/.

[46] www.readbag.com, http://www.readbag.com/robots-stanford-papers-thrun-probrob

[47] H. Choset, K. M. Lynch, S. Hutchinson, G. A. Kantor, W. Burgard, L. E. Kavraki, and S. Thrun, Principles of Robot Motion: Theory Algorithms and Implementations, MIT Press, June 2005, https://books.google.co.id/books?id=S3biKR21i-QC.

[48] D. Vasquez, T. Fraichard, and C. Laugier, “Incremental Learning of Statistical Motion Patterns with Growing Hidden Markov Models,” IEEE Transactions on Intelligent Transportation Systems, vol. 10, no. 3, pp. 403-416, 2009, https://doi.org/10.1109/TITS.2009.2020208.

[49] F. Dawood and C. Kiong Loo, “Robot Behaviour Learning Using Topological Gaussian Adaptive Resonance Hidden Markov Model,” Neural Computing and Applications, vol. 27, no. 8, pp. 2509-2522, 2016. https://doi.org/10.1007/s00521-015-2021-x.

[50] E. L. Thorn Jr, “Autonomous Motion Planning Using a Predictive Temporal Method,” Ph.D. Thesis University of Florida, Dec 2009, https://apps.dtic.mil/sti/pdfs/ADA544950.pdf.

[51] A. Bautin, L. Martinez-Gomez, and T. Fraichard, “Inevitable Collision States: A Probabilistic Perspective,” IEEE International Conference on Robotics and Automation 2010, pp. 4022-4027, May 2010, https://doi.org/10.1109/ROBOT.2010.5509233.

[52] J. Hernández-Aceituno, L. Acosta, and J. D. Pinero, “Application of Time Dependent Probabilistic Collision State Checkers in Highly Dynamic Environments,” IEEE International Conference on Robotics and Automation. PLoS One, vol. 10, no. 3, e0119930, 2015, https://doi.org/10.1371/journal.pone.0119930.

[53] L.R. Rabiner, “A Tutorial on Hidden Markov Models and Selected Applications in Speech Recognition,” Readings in speech recognition, vol. 77, no. 2, pp 267-296, Feb 1989, https://doi.org/10.1109/5.18626.

[54] D. Althoff, D. Wollherr, and M. Buss, “Safety Assessment of Trajectories for Navigation in Uncertain and Dynamic Environments,” IEEE International Conference on Robotics and Automation, pp. 5407-5412, May 2011, https://doi.org/10.1109/ICRA.2011.5980115.

[55] N. Roy, W. Burgard, D. Fox, and S. Thrun, “Coastal navigation–mobile Robot Navigation with Uncertainty in Dynamic Environment,” Proceedings IEEE international conference on robotics and automation, pp. 35-40, 1999, https://doi.org/10.1109/ROBOT.1999.769927.

[56] F. Rohrmuller, M. Althoff, D. Wollherr, and M. Buss, “Probabilistic Mapping of Dynamic Obstacles Using Markov Chains for Replanning in Dynamic Environments,” IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 2504-2510, 2008, https://doi.org/10.1109/IROS.2008.4650952.

[57] C. Fulgenzi, C. Tay, A. Spalanzani, and C. Laugier, “Probabilistic Navigation In Dynamic Environment Using Rapidly-Exploring Random Trees And Gaussian Processes,” IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 1056-1062, 2008, https://doi.org/10.1109/IROS.2008.4650959.

[58] R. E. Bellman, Dynamic Programming, Princeton University Press, 2021, https://doi.org/10.1515/9781400835386.

[59] R. S. Sutton and A.G. Barto, Reinforcement Learning: An Introduction, MIT Press, 2018, https://books.google.co.id/books?id=uWV0DwAAQBAJ.

[60] R. E. Bellman, Adaptive Control Processes: A Guided Tour, Princeton University Press, 2015, https://doi.org/10.1515/9781400874668.

[61] L. K. Platzman, “Finite Memory Estimation and Control of Finite Probabilistic Systems,” Ph.D. Thesis Massachusetts Institute of Technology, January 1977, https://apps.dtic.mil/sti/citations/ADA038813.

[62] M. Farrokhsiar, “MPC-based Mobile Robots Motion Planning and Control in Uncertain Dynamic Environment,” Ph.D. Thesis University of British Columbia, April 2015, https://central.bac-lac.gc.ca/.item?id=TC-BVAU-52950&op=pdf&app=Library&oclc_number=1032940869.

[63] D. Held, D. Guillory, B. Rebsamen, S. Thrun, S. Savarese, “A Probabilistic Framework For Real-Time 3D Segmentation Using Spatial Temporal and Semantic Cues,” Robots: Science and Systems (RSS), vol. 12, 2016, http://davheld.github.io/segmentation3D/segmentation_extended.pdf.

[64] R. A. Howard, “Dynamic Programming and Markov Process,” MIT Press, 1960, https://psycnet.apa.org/record/1961-01474-000.

[65] M. Bennewitz, W. Burgard, and S. Thrun, “Learning Motion Patterns of Persons for Mobile Service Robots,” Proc. of the IEEE Int. Conf. On Robotics and Automation Washington USA, pp. 3601-3606, 2002, https://doi.org/10.1109/ROBOT.2002.1014268.

[66] M. Althoff, O. Stursberg, and M. Buss, “Model-based Probabilistic Collision Detection in Autonomous Driving,” IEEE Transactions on Intelligent Transportation Systems, vol. 10, pp. 299 – 310, 2009, https://doi.org/10.1109/TITS.2009.2018966

[67] J. Hernández-Aceituno, L. Acosta, and José D. Piñeiro, “Application of time dependent probabilistic collision state checkers in highly dynamic environments,” PLoS One, vol. 10, no. 3, 2015, https://doi.org/10.1371/journal.pone.0119930.

[68] D. Fox, W. Burgard, and S. Thrun, “Markov Localization for Mobile Robots in Dynamic Environment,” Journal of Artificial Intelligence Research, vol. 11, pp. 391-427, 1999, https://doi.org/10.1613/jair.616.

[69] S. Thrun, “Robotic mapping: A Survey School,” Carnegie Mellon University, 2002, http://robots.stanford.edu/papers/thrun.mapping-tr.pdf.

[70] S. Thrun, “Probabilistic Algorithms in Robotics,” Ai Magazine, vol. 21, no. 4, p. 93, 2000, https://doi.org/10.1609/aimag.v21i4.1534.

[71] L. Moreno, S. Garrido, and M. L. Munoz, “Evolutionary Filter for Robust Mobile Robot Global Localization,” Robotics and Autonomous Systems, vol. 54, no. 7, pp. 590-600, 2006, https://doi.org/10.1016/j.robot.2006.02.009.

[72] D. Fox, “Makov Localization: A Probabilistic Framework for Mobile Robot Localization and Navigation,” Ph.D. Thesis, Dept. of Computer Science, University of Bonn. Germany, December 1998.

[73] D. Althoff, D. Wollherr, and M. Buss, “Safety Assessment of Trajectories For Navigation In Uncertain and Dynamic Environments Proceedings,” IEEE International Conference on Robotics and Automation, pp. 5407-5412, May 2011, https://doi.org/10.1109/ICRA.2011.5980115.

[74] N. Roy, W. Burgard, D. Fox, and S. Thrun, “Coastal Navigation–Mobile Robot Navigation with Uncertainty In Dynamic Environment,” Proceedings 1999 IEEE international conference on robotics and automation, pp. 35-40, 1999, https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.31.5110&rep=rep1&type=pdf.

[75] N.E. Du Toit, J.W. Burdick, “Robot Motion Planning in Dynamic Uncertain Environments,” IEEE Transactions on Robotics, vol. 28, no. 1, 2011, https://doi.org/10.1109/TRO.2011.2166435.

[76] M.G.Mohanan, A. Salgaonkar, “Probabilistic Approach to Robot Motion Planning In Dynamic Environments,” SN Computer Science, vol. 1, no. 3, pp. 1-6, 2020, https://doi.org/10.1007/s42979-020-00185-0.

[77] C. Fulgenzi, A. Spalanzani, and C. Laugier, “Dynamic Obstacle Avoidance In Uncertain Environment Combining Pvos And Occupancy Grid,” Proceedings of the IEEE Int. Conf. on Robotics and Automation, Apr 2007, https://doi.org/10.1109/ROBOT.2007.363554.

[78] D. Althoff, M. Althoff, D. Wollherr, and M. Buss, “Probabilistic Checker for Crowded Environment,” IEEE International Conference on Robotics and Automation (ICRA), pp. 1492-1498, May 2010, https://doi.org/10.1109/ROBOT.2010.5509369.

[79] A. Jain, S. Chauhan, A. Hirlekar, and S. Sarange, “Automated Restaurant Management System,” International Journal of Innovative Research in Electrical Electronics Instrumentation and Control Engineering, vol. 4, no. 5, 2016, https://www.ijireeice.com/upload/2016/may-16/IJIREEICE%208.pdf.

[80] D. Mirgal, P. Parab, A. Puro, and B. Dakhare, “Smart Automated Restaurant,” IJESC, vol. 8, no. 4, 2018, https://ijesc.org/upload/cd012d0986d211503636e18a80f18207.Smart%20Automated%20Restaurant.pdf.

[81] N. Mishra, D. Goyal, A. D. Sharma, “Automation in Restaurants: Ordering to Robots in Restaurant Via Smart Ordering System,” International Journal of Converging Technologies & Management, vol. 4, no. 1, pp, 1-4, 2018, https://www.gyanvihar.org/researchjournals/ctmpaper2017/IJCTM%20Vol_4_Iss_1_1.pdf.

[82] M. Asif, M. Sabeel, and Z. Khan, “Waiter Robot - Solution to Restaurant Automation, ” 1st Student Multi Disciplinary Research Conference (MDSRC), Nov 2015.

[83] L. Jaillet and T. Simeon, “A PRM-based Motion Planner for Dynamically Changing Environments,” Proceedings of the IEEE Int. Conference on Robots & Systems, vol. 2, pp. 1606-1611, 2004, https://hal.laas.fr/hal-01987651/document.

[84] L.E. Kavraki, P. Svestka, J.C. Latombe, and M. Overmars, “Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces,” IEEE Trans. Robot. Autom, vol. 12, no. 4, p. 5, 1996, https://doi.org/10.1109/70.508439.

[85] L. Jaillet, J. Cortes, and T. Simeon, “Sampling-based Path Planning on Configuration-Space Costmaps,” IEEE Transactions on Robotics, vol. 26, no. 4, August 2010, https://doi.org/10.1109/70.508439.

[86] H. Ulbrich, J. Baur, J. Pfaff, and C. Schuetz, “Design and Realization of A Redundant Modular Multipurpose Agricultural Robot,” DINAME - Proceedings of the XVII International Symposium on Dynamic Problems of Mechanics Brazil, pp. 22-27, February 2015, https://mediatum.ub.tum.de/1245752.

[87] J. Baur, C. Schütz, J. Pfaff, T. Buschmann, and H. Ulbrich, “Path Planning for a Fruit Picking Manipulator,” International Conference of Agricultural Engineering, 2014, http://www.geyseco.es/geystiona/adjs/comunicaciones/304/C03090001.pdf.

[88] N. Reed, S.J. Miles, J. Butler, M. Baldwin, and R. Noble, “Automatic Mushroom Harvester Development,” Journal of Agricultural Engineering, vol. 78, no. 1, pp. 15-23, 2001, https://doi.org/10.1006/jaer.2000.0629.

[89] J. H. Rowley, “Developing Flexible Automation for Mushroom Harvesting (Agaricus bisporus) : innovation report,” Ph.D. Thesis the University of Warwick, June 2009, http://wrap.warwick.ac.uk/36893/.

[90] O. Ringdahl, “Automation in Forestry–Development of Unmanned Forwarders,” Ph.D. Thesis Department of Computing Science Umeå University, 2011, https://www.diva-portal.org/smash/record.jsf?pid=diva2%3A412664&dswid=-8601.

[91] S. Bachche, “Deliberation on Design Strategies of Automatic Harvesting Systems: A Survey,” Robotics, vol. 4, no. 2, pp. 194-222, 2015, https://doi.org/10.3390/robotics4020194.

[92] H. M. Dee, “Explaining Visible Behaviour,” Ph.D. Thesis University of Leeds, 2005, https://etheses.whiterose.ac.uk/1338/.

[93] J. P. Van den Berg, “Path Planning in Dynamic Environments,” Ph.D. Thesis Utrecht University, 2007, https://dspace.library.uu.nl/handle/1874/20873.

[94] P. Svestka, “Robot Motion Planning Using Probabilistic Roadmaps,” Ph.D. Thesis Utrecht Univ, 1997, https://cir.nii.ac.jp/crid/1570854176381920896.

[95] J. P. Van den Berg and M. H. Overmars, “Roadmap- Based Motion Planning in Dynamic Environments,” IEEE Transactions on Robotics, vol. 21, no. 5, pp. 885-897, October 2005, https://doi.org/10.1109/TRO.2005.851378.

[96] J. Van den Berg, M. Lin, and D. Manocha, “Reciprocal Velocity Obstacles for Real-Time Multi-Agent Navigation,” IEEE International Conference on Robotics and Automation (ICRA), pp. 1928-1935, 2008, https://doi.org/10.1109/ROBOT.2008.4543489.

[97] P. Svestka and M. H. Overmars, “Motion Planning for Car-Like Robots a Probabilistic Learning Approach,” Int. Journal of Robotics Research, vol. 16, pp. 119-143, 1997, https://doi.org/10.1177/027836499701600201.

[98] P. Svestka, M.H. Overmars, “Coordinated Path Planning for Multiple,” Robots Robotics and Autonomous Systems, vol. 23, pp. 125-152, 1998, https://doi.org/10.1016/S0921-8890(97)00033-X.

[99] S. A. Wilmarth, N. M. Amato, and P. F. Stiller, “MAPRM: A Probabilistic Roadmap Planner with Sampling on The Medial Axis of The Free Space,” Proc. IEEE Int.Conf. on Robotics and Automation, vol. 2, pp. 1024-1031, 1999, https://doi.org/10.1109/ROBOT.1999.772448.

[100] J. Cortes, T. Simeon, and J. P. Laumond, “A Random Loop Generator for Planning the Motions of Closed Kinematic Chains Using PRM Methods,” Proc. IEEE Int. Conf. on Robotics and Automation, vol. 2, pp. 2141-2146, 2002, https://doi.org/10.1109/ROBOT.2002.1014856.

[101] L. K. Dale and N. M. Amato, “Probabilistic Roadmaps -Putting It All Together,” Proc IEEE Int. Conf. on Robotics and Automation, vol. 2, pp. 1940-1947, 2001, https://doi.org/10.1109/ROBOT.2001.932892.

[102] J. P. Van den Berg and M. H. Overmars, “Roadmap-based Motion Planning in Dynamic Environments,” IEEE Transactions on Robotics, vol. 21, no. 5, October 2005, https://doi.org/10.1109/TRO.2005.851378.

[103] R. Philippsen, “Motion Planning And Obstacle Avoidance For Mobile Robots in Highly Cluttered Dynamic Environments,” Ph.D. Thesis EPF Lausanne, 2004, https://infoscience.epfl.ch/record/33615.

[104] L. Han and N. M. Amato, “A Kinematics-Based Probabilistic Roadmap Method for Closed Chain Systems,” Algorithmic and Computational Robotics, 2001, https://www.taylorfrancis.com/chapters/edit/10.1201/9781439864135-33.

[105] J. Rong, P. Wang, Q. Yang, and F. Huang, “A Field-Tested Harvesting Robot for Oyster Mushroom in Greenhouse,” Agronomy, vol. 11, no. 6, p. 1210, Jun. 2021, https://doi.org/10.3390/agronomy11061210.

[106] J. Barraquand, L. Kavraki, J. C. Latombe, T. Y. Li, R. Motwani, and P. Raghavan, “A Random Sampling Scheme for Path Planning,” Int. Journal of Robotics Research, vol. 16, no. 6, pp. 759-774. 1997, https://doi.org/10.1177/027836499701600604.

[107] G. Van Den Bergen, “Collision Detection in Interactive 3D Computer Animation,” Ph.D. Thesis Eindhoven University, 1999, https://research.tue.nl/en/publications/collision-detection-in-interactive-3d-computer-animation.

[108] R. Bohlin and L. E. Kavraki, “Path Planning Using Lazy PRM,” Proc. IEEE Int. Conf. on Robotics and Automation, vol. 1, pp. 521-528, 2000, https://doi.org/10.1109/ROBOT.2000.844107.

[109] V. Boor, M. H. Overmars, A. F. Van Der Stappen, “The Gaussian Sampling Strategy for Probabilistic Roadmap Planners,” Proc. IEEE Int. Conf. on Robotics and Automation, vol. 2, pp. 1018-1023, 1999, https://doi.org/10.1109/ROBOT.1999.772447.

[110] D. Hsu, R. Kindel, J. C. Latombe, and S. Rock, “Randomized kinodynamic motion planning with moving obstacles,” The International Journal of Robotics Research, vol. 21, no. 3, pp. 233-255, 2002, https://doi.org/10.1177/027836402320556421.

[111] A. Stentz, “The Focussed D* Algorithm for Real-Time Replanning,” Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), vol. 95, pp. 1652-1659, 1995, https://dl.acm.org/doi/abs/10.5555/1643031.1643113.

[112] S. Koenig and M. Likhachev, “Improved Fast Replanning for Robot Navigation in Unknown Terrain,” Proceedings of the IEEE International Conference on Robotics and Automation, vol. 1, pp. 968-975, 2002, https://doi.org/10.1109/ROBOT.2002.1013481.

[113] J. J. Kuffner and S. M. LaValle, “RRT-Connect: An Efficient Approach to Single Query Path Planning,” Proc. of the IEEE Int. Conf. on Robotics and Automation, vol. 2, pp. 995-1001, 2000, https://doi.org/10.1109/ROBOT.2000.844730.

[114] P. Cheng and S. M. LaValle, “Resolution Complete Rapidly-Exploring Random Trees,” Proceedings IEEE International Conference on Robotics and Automation (Cat. No.02CH37292), vol. 1, pp. 267-272, 2002, https://doi.org/10.1109/ROBOT.2002.1013372.

[115] M. Pivtoraiko and A. Kelly, “Fast and Feasible Deliberative Motion Planner for Dynamic Environments,” IEEE ICRA, vol. 1, no. 2, 2009, https://www.ri.cmu.edu/pub_files/2009/5/pivtoraiko_kelly_icra09.pdf.

[116] C. Fulgenzi, A. Spalanzani, and C. Laugier, “Probabilistic Rapidly-Exploring Random Trees for Autonomous Navigation Among Moving Pedestrians,” IEEE ICRA, 2009, https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.186.9418&rep=rep1&type=pdf.

[117] S. M. LaValle, “Rapidly- Exploring Random Trees: A New Tool for Path Planning,” IEEE ICRA, 1998, https://www.cs.csustan.edu/~xliang/Courses/CS4710-21S/Papers/06%20RRT.pdf.

[118] J. J. Craig, Introduction to Robotics: Mechanics and Control, Pearson Education, 2005, https://books.google.co.id/books?id=hRzOp_qdxG8C.

[119] Z. R. Novakovic and B. Nemee, “A Solution of The Inverse Kinematics Problem Using the Sliding Mode,” IEEE Transactions on Robotics and Automation, vol. 6, no. 2, pp. 247-252, 1990, https://doi.org/10.1109/70.54740.

[120] C. Welman, “Inverse Kinematics and Geometric Constraints for Articulated Figure Manipulation,” Ph.D. ThesisSimon Fraser University, 1993, https://cseweb.ucsd.edu/classes/wi20/cse169-a/readings/welman.pdf.

[121] S. Kucuk and Z. Bingul, “Robot Kinematics: Forward and Inverse Kinematics,” Industrial Robotics: Theory, Modelling and Control, IntechOpen, 2006, https://doi.org/10.5772/5015.

[122] G. Jin and J. Ni, “Analysis and Simulation on The Kinematics of Robot Dexterous Hand,” 2nd International Conference on Electronics Network and Com, Atlantis Press, pp. 123-127, 2016, https://dx.doi.org/10.2991/icence-16.2016.26.

[123] W. Kwan, “Closed-form and Generalised Inverse Kinematic Solutions for Animating the Human Articulated Structure,” Curtin University of Technology, 1996, https://documents.uow.edu.au/~/kwanwu/Honours-Thesis.pdf.

[124] R. P. Paul, Robot Manipulators: Mathematics Programming and Control, MIT Press, 1981, https://books.google.co.id/books?id=UzZ3LAYqvRkC.

[125] A. H. Watt and M. Watt, Advanced Animation and Rendering Techniques, ACM Press, 1992, https://books.google.co.id/books?id=HvgYAQAAIAAJ.

[126] L. Barinka and Ing. R. Berka, “Inverse kinematics - basic methods,” 2002, https://old.cescg.org/CESCG-2002/LBarinka/paper.pdf.

[127] M. Dorigo, V. Maniezzo, and A. Colorni, “The Ant System: Optimisation by A Colony of Cooperating Agents,” IEEE Transactions on Systems Man and Cybernetics–Part B, vol. 26, no. 1, pp.1-13, 1996, https://doi.org/10.1109/3477.484436.

[128] M. Brand, M. Masuda, N. Wehner, and X.H. Yu, “Ant Colony Optimization Algorithm for Robot Path Planning,” International Conference on Computer Design and Applications (ICCDA), vol. 3, pp. V3-436, 2010, https://doi.org/10.1109/ICCDA.2010.5541300.

[129] F. K. Purian, F. Farokhi, and R. S. Nadooshan, “Comparing The Performance Of Genetic Algorithm And Ant Colony Optimization Algorithm For Mobile Robot Path Planning In The Dynamic Environments With Different Complexities,” Journal of Academic and Applied Studies, vol. 3, no. 2, February 2013, pp. 29-44, 2013, http://academians.org/Media/Default/Articles/February2013/Feb2013-3.pdf.

[130] M. Brand and X. H. Yu, “Autonomous Robot Path Optimization Using Firefly Algorithm,” Proceedings of the 2013 International Conference on Machine Learning and Cybernetics, vol. 3, pp. 1028-1032, 2013, https://doi.org/10.1109/ICMLC.2013.6890747.

[131] A. Hidalgo-Paniagua, M. A. Vega-Rodríguez, J. Ferruz, and N. Pavón, “Solving the Multi-Objective Path Planning Problem in Mobile Robotics with A Firefly-Based Approach,” Soft Comput, vol. 21, no. 4, pp. 949–964, 2017, https://doi.org/10.1007/s00500-015-1825-z.

[132] W. Li, D. Li, and J. Ni, “Diagnosis of Tapping Process Using Spindle Motor Current,” International Journal of Machine Tools & Manufacturing Elsevier, vol. 43, no. 1, pp. 73-79, 2003, https://doi.org/10.1016/S0890-6955(02)00142-6.

[133] B. Zhang, F. Yang, and J. Wang, “Fundamental Aspects in Vibration Assisted Tapping,” Journal of Material Processing Technology Elsevier, vol. 132, no. 1-3, pp. 345-352, 2003, https://doi.org/10.1016/S0924-0136(02)00950-0.

[134] K. Akka and F. Khaber, “Mobile Robot Path Planning Using an Improved Ant Colony Optimization,” International Journal of Advanced Robotic Systems, vol. 15, no. 3, pp. 1-7, May-June 2018, https://doi.org/10.1177/1729881418774673.

[135] M. R. Zeng, L. Xi, and A. M. Xiao, “The Free Step Length Ant Colony Algorithm in Mobile Robot Path Planning,” Advanced Robotics, vol. 30, no. 23, pp. 1509-1514, 2016, https://doi.org/10.1080/01691864.2016.1240627.

[136] B. K. Patle, A. Pandey, A. Jagadeesh, and D. R. Parhi, “Path Planning in Uncertain Environment by Using Firefly Algorithm,” Elsevier Defence Technology, vol. 14, no. 6, pp. 691-701, Jun 2018, https://doi.org/10.1016/j.dt.2018.06.004.

[137] J. Cao, “Robot Global Path Planning Based on An Improved Ant Colony Algorithm,” Journal of Computer and Communications, vol. 4, no. 2, p. 11, 2016, https://doi.org/10.4236/jcc.2016.42002.

[138] X. S. Yang, “Firefly Algorithms for Multimodal Optimization,” Stochastic Algorithms: Foundations and Applications SAGA Lecture Notes in Computer Sciences, vol. 5792, pp. 169-178, 2009, https://doi.org/10.1007/978-3-642-04944-6_14.

[139] A. Pandey, “Mobile Robot Navigation in Static and Dynamic Environments Using Various Soft Computing Techniques,” Ph.D. thesis National Institute of Technology Rourkela, 2016, http://ethesis.nitrkl.ac.in/8038/.

[140] Y. Xue and J. Q. Sun, “Solving the Path Planning Problem in Mobile Robotics with The Multi-Objective Evolutionary Algorithm,” Applied Sciences, vol. 8, no. 9, p. 1425, August 2018, https://doi.org/10.3390/app8091425.

[141] L. Luo, H. Wen, Q. Lu, H. Huang, W. Chen, X. Zou, and C. Wang, “Collision-Free Path-Planning for Six-DOF Serial Harvesting Robot Based on Energy Optimal and Artificial Potential Field,” Complexity, 2018, https://doi.org/10.1007/978-3-642-04944-6_14.

[142] S. M. Zadeh, “Autonomous Reactive Mission Scheduling and Task-Path Planning Architecture for Autonomous Underwater Vehicle,” Ph.D. Thesis Flinders University of South Australia, Dec 2016, https://doi.org/10.48550/arXiv.1706.04189.

[143] C. M. Clark, “Dynamic Robot Networks: A Coordination Platform for Multi Robot Systems,” Ph. D thesis Stanford University, May 2004, https://digitalcommons.calpoly.edu/csse_fac/77/.

[144] M. L. Puterman, “Markov Decision Processes: Discrete Stochastic Dynamic Programming,” John Wiley & Sons, 2014, https://books.google.co.id/books?id=VvBjBAAAQBAJ.

[145] K. Kamei, S. Nishio, N. Hagita, and M. Sato, “Cloud Network Robotics,” IEEE Network Magazine, vol. 26, no. 3, pp. 28-34, May 2012, https://doi.org/10.1109/MNET.2012.6201213.

[146] M. G. Mohanan and A. Salgaonkar, “Robotic Mushroom Harvesting by Employing Probabilistic Road Map and Inverse Kinematics,” BOHR International Journal of Future Robotics and Artificial Intelligence, vol. 1, no.1, pp. 1-10, 2021, https://doi.org/10.54646/bijfrai.001.


Refbacks

  • There are currently no refbacks.


Copyright (c) 2022 M. G. Mohanan, Ambuja Salgaonkar

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

 

About the JournalJournal PoliciesAuthor Information

International Journal of Robotics and Control Systems
e-ISSN: 2775-2658
Website: https://pubs2.ascee.org/index.php/IJRCS
Email: ijrcs@ascee.org
Organized by: Association for Scientific Computing Electronics and Engineering (ASCEE), Peneliti Teknologi Teknik Indonesia, Department of Electrical Engineering, Universitas Ahmad Dahlan and Kuliah Teknik Elektro
Published by: Association for Scientific Computing Electronics and Engineering (ASCEE)
Office: Jalan Janti, Karangjambe 130B, Banguntapan, Bantul, Daerah Istimewa Yogyakarta, Indonesia