Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/32281Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Zhang, M | - |
| dc.contributor.author | Yang, Q | - |
| dc.contributor.author | Sutcliffe, M | - |
| dc.contributor.author | Nicholson, I | - |
| dc.coverage.spatial | London, UK | - |
| dc.date.accessioned | 2025-11-04T16:25:02Z | - |
| dc.date.available | 2025-11-04T16:25:02Z | - |
| dc.date.issued | 2025-09-01 | - |
| dc.identifier | ORCiD: Qingping Yang https://orcid.org/0000-0002-2557-8752 | - |
| dc.identifier | Article number: 05002 | - |
| dc.identifier.citation | Zhang, M. et al. (2025) 'NEAT-based 3D path planning for mobile robotic arms in NDT with offline inverse kinematics validation', MATEC Web of Conferences, 413, 05002, pp. 1 - 6. doi: 10.1051/matecconf/202541305002. | en_US |
| dc.identifier.issn | 2274-7214 | - |
| dc.identifier.uri | https://bura.brunel.ac.uk/handle/2438/32281 | - |
| dc.description.abstract | To address the challenges of coverage completeness and path executability in mobile robotic arm planning for industrial ultrasonic nondestructive testing (NDT), this study proposes a 3D path planning method that combines the Neuro-Evolution of Augmenting Topologies (NEAT) algorithm with offline inverse kinematics (IK) checking. First, a graph structure is built from the point cloud data of the target surface, and the NEAT algorithm is used to evolve an access strategy that simultaneously optimizes coverage, path smoothness, and path length. An offline IK validation step is introduced to pre-evaluate the reachability of each node using a standard solver in ROS. Based on the IK results, the node selection is further optimized to reduce the risk of execution failure. For nodes that are unreachable by the robotic arm, static position adjustments of the mobile chassis (Husky) are applied to help maintain overall path coverage. Simulation results on the ROS + Rviz platform across different surface geometries show that the proposed method achieves 100% surface coverage in all tested cases, with no collisions occurring during execution. It provides a practical solution for inspection scenarios where arm reachability and surface complexity present significant challenges. | en_US |
| dc.format.extent | 1 - 6 | - |
| dc.format.medium | Print-Electronic | - |
| dc.language | English | - |
| dc.language.iso | en | en_US |
| dc.publisher | EDP Sciences | en_US |
| dc.rights | Creative Commons Attribution 4.0 International | - |
| dc.rights.uri | https://creativecommons.org/licenses/by/4.0/ | - |
| dc.source | International Conference on Measurement, AI, Quality and Sustainability (MAIQS 2025) | - |
| dc.source | International Conference on Measurement, AI, Quality and Sustainability (MAIQS 2025) | - |
| dc.title | NEAT-based 3D path planning for mobile robotic arms in NDT with offline inverse kinematics validation | en_US |
| dc.type | Conference Paper | en_US |
| dc.date.dateAccepted | 2025-06-08 | - |
| dc.identifier.doi | https://doi.org/10.1051/matecconf/202541305002 | - |
| dc.relation.isPartOf | MATEC Web of Conferences | - |
| pubs.finish-date | 2025-08-28 | - |
| pubs.finish-date | 2025-08-28 | - |
| pubs.publication-status | Published | - |
| pubs.start-date | 2025-08-26 | - |
| pubs.start-date | 2025-08-26 | - |
| pubs.volume | 413 | - |
| dc.identifier.eissn | 2261-236X | - |
| dc.rights.license | https://creativecommons.org/licenses/by/4.0/legalcode.en | - |
| dcterms.dateAccepted | 2025-06-08 | - |
| dc.rights.holder | The Authors | - |
| Appears in Collections: | Dept of Mechanical and Aerospace Engineering Research Papers | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| FullText.pdf | Copyright © The Authors, published by EDP Sciences, 2025. Licence: Creative CommonsThis is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0 (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. | 753.78 kB | Adobe PDF | View/Open |
This item is licensed under a Creative Commons License