DARP: Divide Areas Algorithm for Optimal Multi-Robot Coverage Path Planning

This paper deals with the path planning problem of a team of mobile robots, in order to cover an area of interest, with prior-defined obstacles. For the single robot case, also known as single robot coverage path planning (CPP), an (n) optimal methodology has already been proposed and evaluated in the literature, where n is the grid size. The majority of existing algorithms for the multi-robot case (mCPP), utilize the aforementioned algorithm. Due to the complexity, however, of the mCPP, the best the existing mCPP algorithms can perform is at most 16 times the optimal solution, in terms of time needed for the robot team to accomplish the coverage task, while the time required for calculating the solution is polynomial. In the present paper, we propose a new algorithm which converges to the optimal solution, at least in cases where one exists. The proposed technique transforms the original integer programming problem (mCPP) into several single-robot problems (CPP), the solutions of which constitute the optimal mCPP solution, alleviating the original mCPP explosive combinatorial complexity. Although it is not possible to analytically derive bounds regarding the complexity of the proposed algorithm, extensive numerical analysis indicates that the complexity is bounded by polynomial curves for practically sized inputs. In the heart of the proposed approach lies the DARP algorithm, which divides the terrain into a number of equal areas each corresponding to a specific robot, so as to guarantee complete coverage, non-backtracking solution, minimum coverage path, while at the same time does not need any preparatory stage (video demonstration and standalone application are available on-line http://tinyurl.com/DARP-app)

A general framework of high-performance machine learning algorithms : application in structural mechanics

Data-driven models utilizing powerful artificial intelligence (AI) algorithms have been implemented over the past two decades in different fields of simulation-based engineering science. Most numerical procedures involve processing data sets developed from physical or numerical experiments to create closed-form formulae to predict the corresponding systems’ mechanical response. Efficient AI methodologies that will allow the development and use of accurate predictive models for solving computational intensive engineering problems remain an open issue. In this research work, high-performance machine learning (ML) algorithms are proposed for modeling structural mechanics-related problems, which are implemented in parallel and distributed computing environments to address extremely computationally demanding problems. Four machine learning algorithms are proposed in this work and their performance is investigated in three different structural engineering problems. According to the parametric investigation of the prediction accuracy, the extreme gradient boosting with extended hyper-parameter optimization (XGBoost-HYT-CV) was found to be more efficient regarding the generalization errors deriving a 4.54% residual error for all test cases considered. Furthermore, a comprehensive statistical analysis of the residual errors and a sensitivity analysis of the predictors concerning the target variable are reported. Overall, the proposed models were found to outperform the existing ML methods, where in one case the residual error was decreased by 3-fold. Furthermore, the proposed algorithms demonstrated the generic characteristic of the proposed ML framework for structural mechanics problems.The EuroCC Project (GA 951732) and EuroCC 2 Project (101101903) of the European Commission. Open access funding provided by University of Pretoria.https://link.springer.com/journal/466hj2024Civil EngineeringSDG-09: Industry, innovation and infrastructur

Autonomous trajectory design system for mapping of unknown sea-floors using a team of AUVs

This research develops a new on-line trajectory planning algorithm for a team of Autonomous Underwater Vehicles (AUVs). The goal of the AUVs is to cooperatively explore and map the ocean seafloor. As the morphology of the seabed is unknown and complex, standard non-convex algorithms perform insufficiently. To tackle this, a new simulationbased approach is proposed and numerically evaluated. This approach adapts the Parametrized Cognitive-based Adaptive Optimization (PCAO) algorithm. The algorithm transforms the exploration problem to a parametrized decision-making mechanism whose real-time implementation is feasible. Upon that transformation, this scheme calculates off-line a set of decision making mechanism’s parameters that approximate the - nonpractically feasible - optimal solution. The advantages of the algorithm are significant computational simplicity, scalability, and the fact that it can straightforwardly embed any type of physical constraints and system limitations. In order to train the PCAO controller, two morphologically different seafloors are used. During this training, the algorithm outperforms an unrealistic optimal-one-step-ahead search algorithm. To demonstrate the universality of the controller, the most effective controller is used to map three new morphologically different seafloors. During the latter mapping experiment, the PCAO algorithm outperforms several gradient-descent-like approaches

Cedd: Color and edge directivity descriptor: A compact descriptor for image indexing and retrieval

Abstract. This paper deals with a new low level feature that is extracted from the images and can be used for indexing and retrieval. This feature is called “Color and Edge Directivity Descriptor ” and incorporates color and texture information in a histogram. CEDD size is limited to 54 bytes per image, rendering this descriptor suitable for use in large image databases. One of the most important attribute of the CEDD is the low computational power needed for its extraction, in comparison with the needs of the most MPEG-7 descriptors. The objective measure called ANMRR is used to evaluate the performance of the proposed feature. An online demo that implements the proposed feature in an image retrieval system is available at