| 1. |
- Ramasamy, Sudha, 1974-, et al.
(författare)
-
Optimized Online Path Planning Algorithms Considering Energy
- 2021
-
Ingår i: Proceedings. - : IEEE conference proceedings. - 9781728129891 ; , s. 1-08
-
Konferensbidrag (refereegranskat)abstract
- Plug and produce demonstrators handles multiple processes in the industry, appropriate path planning is essential and at the same time there is an increasing emphasis on more sustainable processes. To ensure the sustainability and automate these processes optimized path planning is required. We present an implementation of a path planning algorithm, which creates a smooth collision free path and considers energy use. In the paper, we demonstrated the implementation of PRM (Probabilistic Road Map) path planning and Dijkstra based optimization algorithm in a simulation environment and thereafter test in a real plug and produce demonstrator. To validate the simulated results the real energy was measured through the signal analyzer online. The measured results outlined in this paper includes; computational time, move along path time, and energy use with different loads. From the experiments and results we conclude that the combination of the two algorithms, PRM with Dijkstra, can be used to generate a collision free optimized path. Here we have considered the distance as the cost function for Dijkstra optimization algorithm and measured the energy of the collision free optimized path. The practical implication of this research is as an enabler for any kind of application where there are large variations of orders e.g., kitting techniques in assembly operations for manufacturing industry.
|
|
| 2. |
- Ramasamy, Sudha, 1974-, et al.
(författare)
-
Optimized Path Planning by Adaptive RRT* Algorithm for Constrained Environments Considering Energy
- 2021
-
Ingår i: Proceedings 2021. - : IEEE conference proceedings. - 9781728129891 ; , s. 1-8
-
Konferensbidrag (refereegranskat)abstract
- Optimized path planning of robots are necessary for the industries to thrive towards greater flexibility and sustainability. This paper proposes an implementation of a collision-free path with the shortest distance. The novelty of the work presented is the new ARRT*(Adaptive Rapidly exploring Random Tree Star) algorithm, which is modified from the RRT*(Rapidly exploring Random Tree Star). In a constraint environment, RRT* algorithms tend to fail when searching for suitable collision-free paths. The proposed ARRT* algorithm gives an optimized feasible collision-free paths in a constraint environment. The feasibility to implement RRT* and ARRT* in a Multi Agent System as a path agent for online control of robots is demonstrated. We have created a digital twin simulated environment to find a collision-free path based on these two algorithms. The simulated path is tested in real robots for feasibility and validation purpose. During the real time implementation, we measured the following parameters: the algorithm computation time for generating a collision-free path, move along time of the path in real time, and energy consumed by each path. These parameters were measured for both the RRT* and the ARRT* algorithms and the test results were compared. The test results were showing that ARRT* performs better in a constrained environment. Both algorithms were tested in a Plug and Produce setup and we find that the generated paths for both algorithms are suitable for online path planning applications.
|
|
