Open Access Open Access  Restricted Access Subscription or Fee Access

Path Planning of an AGV in the Presence of Two Elliptical Forbidden Regions


(*) Corresponding author


Authors' affiliations


DOI: https://doi.org/10.15866/ireme.v12i4.12562

Abstract


The paper presents the methodology to obtain the path planning of an AGV in the presence of elliptical forbidden regions. The algorithms to compute the shortest unconstrained Euclidean distances are presented. In case of the elliptical forbidden regions Further Reduced Search Area (FRSA) Technique is used. This approach overcomes the inadequacies of earlier techniques and can yield solutions to problems involving elliptical forbidden regions. The MATLAB programming is graphic interactive and enables the user to continuously monitor the state and progress of computation. Min-sum criteria have been used to find optimum location of a new facility through revised Hook and Jeeves search method.
Copyright © 2018 Praise Worthy Prize - All rights reserved.

Keywords


AGV; Unconstrained Path; Euclidean Norm; Hook and Jeeves Method; FRSA; Elliptical Forbidden Region

Full Text:

PDF


References


Cooper L., Katz I. N., Facility location in the presence of forbidden regions, II: Euclidean distance and several forbidden circles, Tech. Report OREM 79006, 1979.

Cooper L., Katz I. N., Facility location in the presence of forbidden regions, I: Formulation and the case of Euclidean distance with one forbidden circle, Euro. J. Oper. Res., 6 (1981) 166-173.
http://dx.doi.org/10.1016/0377-2217(81)90203-4

Mohan K. V. V., Some Studies on Optimal Obstacle Free Path Planning for Mobile Robots. Ph.D Thesis, Andhra University, India, 2003.

Raju K. V. L., Some studies on optimum facility location problems in the presence of forbidden regions. Ph.D. Thesis, Andhra University, India, 2002.

Ravindranath K., Singh N., Vrat P., Bicriteria of single facility rectilinear location problems in the presence of a single forbidden region, OPSEARCH, 22 (1985)1-16.

Ravindranath K., Vrat P., Singh N., On solving single and multifacilitylocation problems with mixed mode of travel by HAP, Proc. XV National ORST Convention, IIT KH, 1986.

Seshasayee K. R., Some Studies on Facility Location Problems in the Presence of Forbidden Regions,Ph.D Thesis, IIT, Delhi, 1986.

Raju K. V. L.,V. V. Rama Reddy, B. Satyanarayana, V. Ramachandhra Raju, Facility Location Problems in the Presence of Two Convex/Non-Convex Polygonal Barrier/ Forbidden Regions, Journal of Industrial Engineering , 36 (2007)27-33.
http://dx.doi.org/10.1007/bf03398836

Raju K. V. L., V. V. Rama Reddy, B. Satyanarayana, V. Ramachandhra Raju, Iso-Cost Contours to Facility Location Problems in the Presence of Circular and Polygonal Forbidden Regions, OPSEARCH, 44 (2007) 304-321.

Ravindra Nadh, P., Satyanarayana, B., Ramji, K., “Obstacle Avoidance of Mobile Robots –A New Geometric Approach”. National Conference on Factory Automation, Robotics and Soft Computing, National Institute of Technology, Warangal, India, Jan, 2007.

Seshasayee, K. R., “Some studies on facility location problems in the presence of forbidden regions”, Ph.D. thesis, IIT, Delhi, India, 1986.

Viswa Mohan, K. V., “Some studies on optimal obstacle-free path planning for mobile robots”, Ph. D. Thesis, Andhra University, India, 2003.

Kant K., Zucker, S. W., “Planning collision-free trajectories in time-varying environments: a two level approach” , Proc. of Int. Conf,. on Robotics and Automation 1988, pp.1644-1649,1988.
http://dx.doi.org/10.1109/robot.1988.12302

Fujimura, K., “Route planning for mobile robots amidst moving obstacles”, Proc. of IEEE/RSJ Int. Conf. on Intelligent Robots and Systems ‘92” pp.433-438, July, 1992.
http://dx.doi.org/10.1109/iros.1992.587372

Arai T., Ota, J., “Motion planning of multiple mobile robots” Proc. of IEEE/RSJ Int. WS. on Intelligent Robots and Systems ‘92” pp.1761-1768, July, 1992.
http://dx.doi.org/10.1109/iros.1992.601383

Reif, J., and Sharir, M., “Motion planning in the presence of moving obstacles”, 25th IEEE Symp. on the Found. of Comp. Sci. , pp 144-153, 1985.
http://dx.doi.org/10.1109/sfcs.1985.36

Erdmann, M., and Lazano Perez, T., “On multiple moving objects”, Algorthmica 2(4): 477-521, 1987.
http://dx.doi.org/10.1007/bf01840371

Fraichard, T., “Dynamic trajectory planning with dynamic constraints: a state-time space approach”, IEEE/RSJ Int. Conf. on Intelligent Robots and Systems, pp. 1393-1400, 1993.
http://dx.doi.org/10.1109/iros.1993.583794

Fujimura K. and Samet H. “A hierarchical strategy for path planning among moving obstacles”, IEEE Trans. Robotics and Automation, 5(1) : 61-69, 1989.
http://dx.doi.org/10.1109/70.88018

Fiorini P., and Shiller, Z., “Motion planning in dynamic environments using velocity obstacles” IEEE -The Intn. J of Robotics Research, 17(7), pp 760-772, 1998.
http://dx.doi.org/10.1177/027836499801700706

Tsubouchi T., and Arimoto, S., “Behavior of a mobile robot navigated by an iterative forecast and planning” Scheme in the presence of multiple moving obstacles” Proc. of IEEE Int. Conf,. on Robotics and Automation, pp.2470-2475, 1994.
http://dx.doi.org/10.1109/robot.1994.351140

Ronald C. Arkin, Intelligent mobile robots in the workplace: Leaving the guide behind, IEA/AIE '88 Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems, Volume 1 Pages 553-561.
http://dx.doi.org/10.1145/51909.51973

Tuan Le-Anh René B. M. De Koster René B. M. De Koster, A review of design and control of automated guided vehicle systems, July 2004. European Journal of Operational Research 171(1):1-23
http://dx.doi.org/10.1016/j.ejor.2005.01.036


Refbacks

  • There are currently no refbacks.


Please send any question about this web site to info@praiseworthyprize.com
Copyright © 2005-2024 Praise Worthy Prize