Time Distance: A Novel Collision Prediction and Path Planning Method

سال انتشار: 1402
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 169

فایل این مقاله در 22 صفحه با فرمت PDF قابل دریافت می باشد

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این مقاله:

شناسه ملی سند علمی:

JR_JACM-9-3_005

تاریخ نمایه سازی: 20 فروردین 1402

چکیده مقاله:

In this paper, a new fast algorithm for path planning and a collision prediction framework for two dimensional dynamically changing environments are introduced. The method is called Time Distance (TD) and benefits from the space-time space idea. First, the TD concept is defined as the time interval that must be spent in order for an object to reach another object or a location. Next, TD functions are derived as a function of location, velocity and geometry of objects. To construct the configuration-time space, TD functions in conjunction with another function named "Z-Infinity" are exploited. Finally, an explicit formula for creating the length optimal collision free path is presented. Length optimization in this formula is achieved using a function named "Route Function" which minimizes a cost function. Performance of the path planning algorithm is evaluated in simulations. Comparisons indicate that the algorithm is fast enough and capable to generate length optimal paths as the most effective methods do. Finally, as another usage of the TD functions, a collision prediction framework is presented. This framework consists of an explicit function which is a function of TD functions and calculates the TD of the vehicle with respect to all objects of the environment.

نویسندگان

Ali Analooee

Department of Mechanical Engineering, K. N. Toosi University of Technology, Tehran, ۱۹۹۱۹۴۳۳۴۴, Iran

Shahram Azadi

Department of Mechanical Engineering, K. N. Toosi University of Technology, Tehran, ۱۹۹۱۹۴۳۳۴۴, Iran

Reza Kazemi

Department of Mechanical Engineering, K. N. Toosi University of Technology, Tehran, ۱۹۹۱۹۴۳۳۴۴, Iran

مراجع و منابع این مقاله:

لیست زیر مراجع و منابع استفاده شده در این مقاله را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود مقاله لینک شده اند :
  • Nilsson, N.J., A mobile automaton: An application of artificial intelligence ...
  • Hwang, Y.K., Ahuja, N., Gross motion planning—a survey, ACM Computing ...
  • Atyabi, A., Powers, D., Review of classical and heuristic-based navigation ...
  • Šeda, M., Roadmap methods vs. cell decomposition in robot motion ...
  • Khatib, O., Mampey, L.M., Fonction decision-commande d’un robot manipulateur, Rep, ...
  • Neville, H., Impedance Control: An Approach to Manipulation: Part I~III, ...
  • Miyazaki, F., Arimoto, S., Takegaki, M., Maeda, Y., Sensory feedback ...
  • Pavlov, V.V., Voronin, A.N., The method of potential functions for ...
  • Khatib, O., Real-time obstacle avoidance for manipulators and mobile robots, ...
  • Kala, R., Warwick, K., Planning autonomous vehicles in the absence ...
  • Rasekhipour, Y., Khajepour, A., Chen, S.K., Litkouhi, B., A potential ...
  • Rasekhipour, Y., Fadakar, I., Khajepour, A., Autonomous driving motion planning ...
  • Ji, J., Khajepour, A., Melek, W.W., Huang, Y., Path planning ...
  • Overmars, M.H., A random approach to motion planning, ۱۹۹۲ ...
  • Svestka, P., A probabilistic approach to motion planning for car-like ...
  • Overmars, M.H., Svestka, P., A probablisitic learning approach to motion ...
  • Kavraki, L., Latombe, J.C., Randomized preprocessing of configuration for fast ...
  • Kavraki, L.E., Svestka, P., Latombe, J.C., Overmars, M.H., Probabilistic roadmaps ...
  • Švestka, P., Overmars, M.H., Motion planning for carlike robots using ...
  • LaValle, S.M., Rapidly-exploring random trees: A new tool for path ...
  • Elbanhawi, M., Simic, M., Sampling-based robot motion planning: A review, ...
  • LaValle, S.M., Planning algorithms, Cambridge University Press, Cambridge, ۲۰۰۶ ...
  • Ignat’ev, M.B., Kulakov, F.M., Pokrovski˘I, A.M., Robot-manipulator control algorithms, Joint ...
  • Lozano-Pérez, T., Wesley, M.A., An algorithm for planning collision-free paths ...
  • Rowat, P.F., Representing spatial experience and solving spatial problems in ...
  • Holland, J.H., Adaptation in Natural and Artificial Systems, University of ...
  • Kennedy, J., Eberhart, R., Particle swarm optimization, Proceedings of ICNN'۹۵-international ...
  • Dorigo, M., Maniezzo, V., Colorni, A., Positive feedback as a ...
  • Dorigo, M., Optimization, learning and natural algorithms, Ph.D. Thesis, Politecnico ...
  • Dorigo, M., Maniezzo, V., Colorni, A., Ant system: optimization by ...
  • Mac, T.T., Copot, C., Tran, D.T., De Keyser, R., Heuristic ...
  • Erdmann, M., Lozano-Perez, T., On multiple moving objects, Algorithmica, ۲(۱), ...
  • Cefalo, M., Oriolo, G., A general framework for task-constrained motion ...
  • Schwesinger, U., Siegwart, R., Furgale, P., Fast collision detection through ...
  • Xidias, E.K., Aspragathos, N.A., Motion planning for multiple non-holonomic robots: ...
  • Alonso-Mora, J., Montijano, E., Nägeli, T., Hilliges, O., Schwager, M., ...
  • Ragaglia, M., Zanchettin, A.M., Rocco, P., Trajectory generation algorithm for ...
  • Gaschler, A., Petrick, R.P., Khatib, O., Knoll, A., KABouM: Knowledge-level ...
  • Cadkhodajafarian, A., Analooee, A., Azadi, S., Kazemi, R., Collision-free navigation ...
  • Analooee, A., Kazemi, R., Azadi, S., SCR-Normalize: A novel trajectory ...
  • Kala, R., Code for Robot Path Planning using Rapidly-exploring Random ...
  • Kala, R., Code for robot path planning using Bidirectional Rapidly-exploring ...
  • Kala, R., Code for robot path planning using Probabilistic Roadmap, ...
  • Kala, R., Code for robot path planning using A* algorithm, ...
  • نمایش کامل مراجع