An algorithm for planning collision-free paths among polyhedral obstacles
Communications of the ACM
Constraint-based motion planning for virtual prototyping
Proceedings of the seventh ACM symposium on Solid modeling and applications
Robot Control: Dynamics, Motion Planning, and Analysis
Robot Control: Dynamics, Motion Planning, and Analysis
Planning Algorithms
Single agent and multi-agent path planning in unknown and dynamic environments
Single agent and multi-agent path planning in unknown and dynamic environments
Building information modelling - Experts' views on standardisation and industry deployment
Advanced Engineering Informatics
The focussed D* algorithm for real-time replanning
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Proceedings of the Winter Simulation Conference
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
Safe and efficient operation of cranes requires not only good planning, but also sufficient and appropriate support in real time. Due to the dynamic nature of construction sites, unexpected changes in site layout may create new obstacles for the crane that can result in collisions and accidents. Previous research on construction equipment motion planning focuses on off-line support, which considers static environment or predictable obstacles. These plans may not fit the reality when the environment has any change. In this case on-site safety and efficiency can be affected. In this research, a motion planning algorithm is proposed to efficiently generate safe and smooth paths for crane motions while taking into account engineering constraints and the path quality. Path smoothness is taken into account to provide a realistic path for cranes and to reduce unnecessary movements. A dynamic motion planning algorithm is proposed to ensure safety during the execution stage by quickly re-planning and avoiding collisions. In addition, an anytime algorithm is proposed to search for better solutions during a given time period by improving path smoothness and by reducing path execution time. The proposed algorithms are compared with other available algorithms to evaluate their performance in terms of planning and re-planning time and the cost of the path. Based on the literature review, this is the first time that dual-tree RRT algorithms have been applied to crane motion planning.