Simulating Ionising Radiation in Gazebo for Robotic Nuclear Inspection Challenges

From MDPI via Jisc Publications RouterHistory: accepted 2021-07-02, pub-electronic 2021-07-07Publication status: PublishedFunder: UK Research and Innovation; Grant(s): EP/P018505/1, EP/R026084/1Funder: Royal Academy of Engineering; Grant(s): CiET1819\13The utilisation of robots in hazardous nuclear environments has potential to reduce risk to humans. However, historical use has been largely limited to specific missions rather than broader industry-wide adoption. Testing and verification of robotics in realistic scenarios is key to gaining stakeholder confidence but hindered by limited access to facilities that contain radioactive materials. Simulations offer an alternative to testing with actual radioactive sources, provided they can readily describe the behaviour of robotic systems and ionising radiation within the same environment. This work presents a quick and easy way to generate simulated but realistic deployment scenarios and environments which include ionising radiation, developed to work within the popular robot operating system compatible Gazebo physics simulator. Generated environments can be evolved over time, randomly or user-defined, to simulate the effects of degradation, corrosion or to alter features of certain objects. Interaction of gamma radiation sources within the environment, as well as the response of simulated detectors attached to mobile robots, is verified against the MCNP6 Monte Carlo radiation transport code. The benefits these tools provide are highlighted by inclusion of three real-world nuclear sector environments, providing the robotics community with opportunities to assess the capabilities of robotic systems and autonomous functionalities

Shortest Route at Dynamic Location with Node Combination-Dijkstra Algorithm

Abstract— Online transportation has become a basic requirement of the general public in support of all activities to go to work, school or vacation to the sights. Public transportation services compete to provide the best service so that consumers feel comfortable using the services offered, so that all activities are noticed, one of them is the search for the shortest route in picking the buyer or delivering to the destination. Node Combination method can minimize memory usage and this methode is more optimal when compared to A* and Ant Colony in the shortest route search like Dijkstra algorithm, but can’t store the history node that has been passed. Therefore, using node combination algorithm is very good in searching the shortest distance is not the shortest route. This paper is structured to modify the node combination algorithm to solve the problem of finding the shortest route at the dynamic location obtained from the transport fleet by displaying the nodes that have the shortest distance and will be implemented in the geographic information system in the form of map to facilitate the use of the system. Keywords— Shortest Path, Algorithm Dijkstra, Node Combination, Dynamic Location (key words