The final, formatted version of the article will be published soon. {The paper discusses computational and numerical challenges that are associated with the truncation of the information and which ...

Abstract: The Travelling Salesman Problem (TSP) is a well known method for the optimisation problem that asks you to find the shortest route that visits each city in a set exactly once and then goes ...

Abstract: Path planning is a critical challenge for autonomous robots. Current algorithms lack environment-based directional guidance, often generating extensive low-quality path explorations that ...