Path-finder. AI-based path planning system

被引:0
|
作者
Morad, A.A. [1 ]
Cleveland Jr., A.B. [1 ]
Beliveau, Y.J. [1 ]
Fransisco, V.D. [1 ]
Dixit, S.S. [1 ]
机构
[1] Florida Int Univ, Miami, United States
关键词
Constructablity - Construction Robotics - Path-finder System;
D O I
暂无
中图分类号
学科分类号
摘要
The issue of constructability has emerged as a primary area of concern in construction planning. To avoid constructability problems, which may result in construction rework, it is necessary to evaluate the constructability of each component at the planning stage, within the constraints of the equipment to be used. This ensures that the planning process generates a feasible construction sequence. This paper presents Path-Finder, an artificial intelligence (AI) based system for improving the constructability of construction facilities. This improvement is accomplished by visual simulation of the construction process during the design phase to avoid future constructability problems. By using a 3D computer model of the designed facility, it is possible to check for the constructability of different sequencing scenarios of various components of the facility prior to construction start. The goal of Path-Finder is to find a collision-free path, to move a specified object from one position and orientation in the 3D computer model to another position and orientation using available manipulation mechanisms (handling equipment). This work focuses on providing a problem-solving strategy to obtain a valid path in a reasonable amount of time. Path-Finder ensures that the solution is a path along which the specified object can always be moved using available manipulation mechanisms. Path-Finder has been implemented in a real-time animation and visualization package called Walkthru.
引用
收藏
页码:114 / 128
相关论文
共 50 条
  • [41] Dynamic Network Provisioning with AI-enabled Path Planning
    Quach, Hong-Nam
    Choi, Chulwoong
    Kim, Kyungbaek
    APNOMS 2020: 2020 21ST ASIA-PACIFIC NETWORK OPERATIONS AND MANAGEMENT SYMPOSIUM (APNOMS), 2020, : 271 - 274
  • [42] PLANNING FOR THE MANUFACTURE OF AXISYMMETRICAL PARTS - AN AI-BASED APPROACH
    JAGDALE, SS
    WANG, KK
    COMPUTERS & INDUSTRIAL ENGINEERING, 1995, 28 (04) : 917 - 925
  • [43] Enterprise Development Planning and AI-Based Technological Forecasting
    Nezhmetdinov R.A.
    Charuiskaya M.A.
    Kovalev I.A.
    Russian Engineering Research, 2023, 43 (10) : 1284 - 1288
  • [44] Curbing the Errors from Automated Tools Based on An FMEA of an AI-Based Treatment Planning System
    Nealon, K.
    Balter, P.
    Douglas, R.
    Fullen, D.
    Hernandez, S.
    Nitsch, P.
    Olanrewaju, A.
    Soliman, M.
    Court, L.
    MEDICAL PHYSICS, 2021, 48 (06)
  • [45] Path finder algorithm used by distributed expert system for traffic control
    Maria-Magdalena, Santa
    Tiberiu, Letia
    Octavian, Cuibus
    2012 IEEE INTERNATIONAL CONFERENCE ON AUTOMATION, QUALITY AND TESTING, ROBOTICS, THETA 18TH EDITION, 2012, : 608 - 611
  • [46] Path Planning of Mobile Robot with Path Rule Mining based on GA
    Lu, Nannan
    Gong, Yunlu
    Pan, Jie
    PROCEEDINGS OF THE 28TH CHINESE CONTROL AND DECISION CONFERENCE (2016 CCDC), 2016, : 1600 - 1604
  • [47] A path planning of mobile robots based on the prediction of path entry point
    Gao, Yang
    Zou, Dan
    Wang, Lai-Jun
    Yang, Jing-Shuai
    Chang'an Daxue Xuebao (Ziran Kexue Ban)/Journal of Chang'an University (Natural Science Edition), 2014, 34 (05): : 138 - 145
  • [48] A Shortest Path Based Path Planning Algorithm for Nonholonomic Mobile Robots
    Kaichun Jiang
    Lakmal D. Seneviratne
    S. W. E. Earles
    Journal of Intelligent and Robotic Systems, 1999, 24 : 347 - 366
  • [49] The Optimal Path Planning for Emergency Vehicles Based on Path Saturation Analysis
    Wu, Zhaoju
    Huang, Min
    Zhang, Teng
    CICTP 2020: TRANSPORTATION EVOLUTION IMPACTING FUTURE MOBILITY, 2020, : 74 - 86
  • [50] Path-length analysis for grid-based path planning
    Bailey, James P.
    Nash, Alex
    Tovey, Craig A.
    Koenig, Sven
    ARTIFICIAL INTELLIGENCE, 2021, 301