Search Results (14)

The application of drones has contributed to automated herbicide spraying in the context of precision agriculture. Although drone technology is mature, the widespread application of agricultural drones and their numerous advantages still demand improvements in battery endurance during flight missions in agricultural operations. This issue has been addressed by optimizing the path planning to minimize the time of the route and, therefore, the energy consumption. In this direction, a novel framework for autonomous drone-based herbicide applications that integrates deep learning-based semantic segmentation and coverage path optimization is proposed. The methodology involves computer vision for path planning optimization. First, semantic segmentation is performed using a DeepLab v3+ convolutional neural network to identify and classify regions containing weeds based on aerial imagery. Then, a coverage path planning strategy is applied to generate efficient spray routes over each weed-infested area, represented as convex polygons, while accounting for the drone’s refueling constraints. The results demonstrate the effectiveness of the proposed approach for optimizing coverage paths in weed-infested sugarcane fields. By integrating semantic segmentation with clustering and path optimization techniques, it was possible to accurately localize weed patches and compute an efficient trajectory for UAV navigation. The GA-based solution to the Traveling Salesman Problem With Refueling (TSPWR) yielded a near-optimal visitation sequence that minimizes the energy demand. The total coverage path ensured complete inspection of the weed-infected areas, thereby enhancing operational efficiency. For the sugar crop considered in this contribution, the time to cover the area was reduced by 66.3% using the proposed approach because only the weed-infested area was considered for herbicide spraying. Validation of the proposed methodology using real-world agricultural datasets shows promising results in the context of precision agriculture to improve the efficiency of herbicide or fertilizer application in terms of herbicide waste reduction, lower operational costs, better crop health, and sustainability. Full article

Reinforcement learning is a crucial area of machine learning, with a wide range of applications. To conduct experiments in this research field, it is necessary to define the algorithms and parameters to be applied. However, this task can be complex because of the variety of possible configurations. In this sense, the adoption of AutoRL systems can automate the selection of these configurations, simplifying the experimental process. In this context, this work aims to propose a simulation environment for combinatorial optimization problems using AutoRL. The AutoRL-Sim includes several experimentation modules that cover studies on the symmetric traveling salesman problem, the asymmetric traveling salesman problem, and the sequential ordering problem. Furthermore, parameter optimization is performed using response surface models. The AutoRL-Sim simulator allows users to conduct experiments in a more practical way, without the need to worry about implementation. Additionally, they have the ability to analyze post-experiment data or save them for future analysis. Full article

As unmanned ground vehicles (UGV) continue to be adapted to new applications, an emerging area lacks proper guidance for global route optimization methodology. This area is surveillance. In autonomous surveillance applications, a UGV is equipped with a sensor that receives data within a specific range from the vehicle while it traverses the environment. In this paper, the ant colony optimization (ACO) algorithm was adapted to the UGV surveillance problem to solve for optimal paths within sub-areas. To do so, the problem was modeled as the covering salesman problem (CSP). This is one of the first applications using ACO to solve the CSP. Then, a genetic algorithm (GA) was used to schedule a fleet of UGVs to scan several sub-areas such that the total distance is minimized. Initially, these paths are infeasible because of the sharp turning angles. Thus, they are improved using two methods of path refinement (namely, the corner-cutting and Reeds–Shepp methods) such that the kinematic constraints of the vehicles are met. Several test case scenarios were developed for Goheung, South Korea, to validate the proposed methodology. The promising results presented in this article highlight the effectiveness of the proposed methodology for UGV surveillance applications. Full article

Since low-power Wi-Fi sensors are connected to the Internet, effective radio spectrum use is crucial for developing an efficient Medium Access Control (MAC) protocol for Wi-Fi sensor networks. A connectivity-based multipolling mechanism was employed for Access Points to grant uplink transmission opportunities to Wi-Fi nodes with a reduced number of multipolling frame transmissions. The existing connectivity-based multipolling mechanism in IEEE 802.11 wireless LANs with many nodes may require excessive time to derive the optimal number of serially connected sequences due to the backtracking algorithm based on the Traveling Salesman Problem model. This limitation hinders the real-time implementation of the connectivity-based multipolling mechanism in Wi-Fi sensor networks. In this study, an efficient node insertion algorithm is proposed, by which the number of derived serially connected multipolling sequences that cover nodes in Wi-Fi sensor networks converges to only one as the number of Wi-Fi sensors increases in Wi-Fi sensor networks. As verified by simulation experiments for Wi-Fi sensor networks, the proposed node insertion algorithm produces a near-optimal number of multipolling sequences that cover the nodes in Wi-Fi sensor networks. This study proposes a node insertion algorithm for the real-time implementation of the connectivity-based multipolling mechanism in MAC protocol for Wi-Fi sensor networks. Full article

Small fixed-wing electric Unmanned Aerial Vehicles (UAVs) are perfect candidates to perform tasks in wide areas, such as photogrammetry, surveillance, monitoring, or search and rescue, among others. They are easy to transport and assemble, have much greater range and autonomy, and reach higher speeds than rotatory-wing UAVs. Aiming to contribute towards their future implementation, the objective of this article is to benchmark commercial, small, fixed-wing, electric UAVs and compatible RGB cameras to find the best combination for photogrammetry and data acquisition of mussel seeds and goose barnacles in a multi-region intertidal zone of the south coast of Galicia (NW of Spain). To compare all the options, a Coverage Path Planning (CPP) algorithm enhanced for fixed-wing UAVs to cover long areas with sharp corners was posed, followed by a Traveling Salesman Problem (TSP) to find the best route between regions. Results show that two options stand out from the rest: the Delair DT26 Open Payload with a PhaseOne iXM-100 camera (shortest path, minimum number of pictures and turns) and the Heliplane LRS 340 PRO with the Sony Alpha 7R IV sensor, finishing the task in the minimum time. Full article

Background: In the context of Warehouse Management Systems, knowledge related to motion trajectory prediction methods utilizing machine learning techniques seems to be scattered and fragmented. Objective: This study seeks to fill this research gap by using a systematic literature review approach. Methods: Based on the data collected from Google Scholar, a systematic literature review was performed, covering the period from 2016 to 2023. The review was driven by a protocol that comprehends inclusion and exclusion criteria to identify relevant papers. Results: Considering the Warehouse Management Systems, five categories of motion trajectory prediction methods have been identified: Deep Learning methods, probabilistic methods, methods for solving the Travelling-Salesman problem (TSP), algorithmic methods, and others. Specifically, the performed analysis also provides the research community with an overview of the state-of-the-art methods, which can further stimulate researchers and practitioners to enhance existing and develop new ones in this field. Full article

Target-barrier coverage is a newly proposed coverage problem in wireless sensor networks (WSNs). The target-barrier is a closed barrier with a distance constraint from the target, which can detect intrusions from outside. In some applications, detecting intrusions from outside and monitoring the targets inside the barrier is necessary. However, due to the distance constraint, the target-barrier fails to monitor and detect the target breaching from inside in a timely manner. In this paper, we propose a convex hull attraction (CHA) algorithm to construct the target-barrier and a UAV-enhanced coverage (QUEC) algorithm based on reinforcement learning to cover targets. The CHA algorithm first divides the targets into clusters, then constructs the target-barrier for the outermost targets of the clusters, and the redundant sensors replace the failed sensors. Finally, the UAV’s path is planned based on QUEC. The UAV always covers the target, which is most likely to breach. The simulation results show that, compared with the target-barrier construction algorithm (TBC) and the virtual force algorithm (VFA), CHA can reduce the number of sensors required to construct the target-barrier and extend the target-barrier lifetime. Compared with the traveling salesman problem (TSP), QUEC can reduce the UAV’s coverage completion time, improve the energy efficiency of UAV and the efficiency of detecting targets breaching from inside. Full article

This paper presents a multi-objective coverage flight path planning algorithm that finds minimum length, collision-free, and flyable paths for unmanned aerial vehicles (UAV) in three-dimensional (3D) urban environments inhabiting multiple obstacles for covering spatially distributed regions. In many practical applications, UAVs are often required to fully cover multiple spatially distributed regions located in the 3D urban environments while avoiding obstacles. This problem is relatively complex since it requires the optimization of both inter (e.g., traveling from one region/city to another) and intra-regional (e.g., within a region/city) paths. To solve this complex problem, we find the traversal order of each area of interest (AOI) in the form of a coarse tour (i.e., graph) with the help of an ant colony optimization (ACO) algorithm by formulating it as a traveling salesman problem (TSP) from the center of each AOI, which is subsequently optimized. The intra-regional path finding problem is solved with the integration of fitting sensors’ footprints sweeps (SFS) and sparse waypoint graphs (SWG) in the AOI. To find a path that covers all accessible points of an AOI, we fit fewer, longest, and smooth SFSs in such a way that most parts of an AOI can be covered with fewer sweeps. Furthermore, the low-cost traversal order of each SFS is computed, and SWG is constructed by connecting the SFSs while respecting the global and local constraints. It finds a global solution (i.e., inter + intra-regional path) without sacrificing the guarantees on computing time, number of turning maneuvers, perfect coverage, path overlapping, and path length. The results obtained from various representative scenarios show that proposed algorithm is able to compute low-cost coverage paths for UAV navigation in urban environments. Full article

One of the essential attributes of a cleaning robot is to achieve complete area coverage. Current commercial indoor cleaning robots have fixed morphology and are restricted to clean only specific areas in a house. The results of maximum area coverage are sub-optimal in this case. Tiling robots are innovative solutions for such a coverage problem. These new kinds of robots can be deployed in the cases of cleaning, painting, maintenance, and inspection, which require complete area coverage. Tiling robots’ objective is to cover the entire area by reconfiguring to different shapes as per the area requirements. In this context, it is vital to have a framework that enables the robot to maximize the area coverage while minimizing energy consumption. That means it is necessary for the robot to cover the maximum area with the least number of shape reconfigurations possible. The current paper proposes a complete area coverage planning module for the modified hTrihex, a honeycomb-shaped tiling robot, based on the deep reinforcement learning technique. This framework simultaneously generates the tiling shapes and the trajectory with minimum overall cost. In this regard, a convolutional neural network (CNN) with long short term memory (LSTM) layer was trained using the actor-critic experience replay (ACER) reinforcement learning algorithm. The simulation results obtained from the current implementation were compared against the results that were generated through traditional tiling theory models that included zigzag, spiral, and greedy search schemes. The model presented in the current paper was also compared against other methods where this problem was considered as a traveling salesman problem (TSP) solved through genetic algorithm (GA) and ant colony optimization (ACO) approaches. Our proposed scheme generates a path with a minimized cost at a lesser time. Full article

This study specifies an agricultural field (Latitude = 56°30′0.8″ N, Longitude = 9°35′27.88″ E) and provides the absolute optimal route for covering that field. The calculated absolute optimal solution for this field can be used as the basis for benchmarking of metaheuristic algorithms used for finding the most efficient route in the field. The problem of finding the most efficient route that covers a field can be formulated as a Traveling Salesman Problem (TSP), which is an NP-hard problem. This means that the optimal solution is infeasible to calculate, except for very small fields. Therefore, a range of metaheuristic methods has been developed that provide a near-optimal solution to a TSP in a “reasonable” time. The main challenge with metaheuristic methods is that the quality of the solutions can normally not be compared to the absolute optimal solution since this “ground truth” value is unknown. Even though the selected benchmarking field requires only eight tracks, the solution space consists of more than 1.3 billion solutions. In this study, the absolute optimal solution for the capacitated coverage path planning problem was determined by calculating the non-working distance of the entire solution space and determining the solution with the shortest non-working distance. This was done for four scenarios consisting of low/high bin capacity and short/long distance between field and storage depot. For each scenario, the absolute optimal solution and its associated cost value (minimum non-working distance) were compared to the solutions of two metaheuristic algorithms; Simulated Annealing Algorithm (SAA) and Ant Colony Optimization (ACO). The benchmarking showed that neither algorithm could find the optimal solution for all scenarios, but they found near-optimal solutions, with only up to 6 pct increasing non-working distance. SAA performed better than ACO, concerning quality, stability, and execution time. Full article

Completed area coverage planning (CACP) plays an essential role in various fields of robotics, such as area exploration, search, rescue, security, cleaning, and maintenance. Tiling robots with the ability to change their shape is a feasible solution to enhance the ability to cover predefined map areas with flexible sizes and to access the narrow space constraints. By dividing the map into sub-areas with the same size as the changeable robot shapes, the robot can plan the optimal movement to predetermined locations, transform its morphologies to cover the specific area, and ensure that the map is completely covered. The optimal navigation planning problem, including the least changing shape, shortest travel distance, and the lowest travel time while ensuring complete coverage of the map area, are solved in this paper. To this end, we propose the CACP framework for a tiling robot called hTrihex with three honeycomb shape modules. The robot can shift its shape into three different morphologies ensuring coverage of the map with a predetermined size. However, the ability to change shape also raises the complexity issues of the moving mechanisms. Therefore, the process of optimizing trajectories of the complete coverage is modeled according to the Traveling Salesman Problem (TSP) problem and solved by evolutionary approaches Genetic Algorithm (GA) and Ant Colony Optimization (ACO). Hence, the costweight to clear a pair of waypoints in the TSP is defined as the required energy shift the robot between the two locations. This energy corresponds to the three operating processes of the hTrihex robot: transformation, translation, and orientation correction. The CACP framework is verified both in the simulation environment and in the real environment. From the experimental results, proposed CACP capable of generating the Pareto-optimal outcome that navigates the robot from the goal to destination in various workspaces, and the algorithm could be adopted to other tiling robot platforms with multiple configurations. Full article

Tiling robots with fixed morphology face major challenges in terms of covering the cleaning area and generating the optimal trajectory during navigation. Developing a self-reconfigurable autonomous robot is a probable solution to these issues, as it adapts various forms and accesses narrow spaces during navigation. The total navigation energy includes the energy expenditure during locomotion and the shape-shifting of the platform. Thus, during motion planning, the optimal navigation sequence of a self-reconfigurable robot must include the components of the navigation energy and the area coverage. This paper addresses the framework to generate an optimal navigation path for reconfigurable cleaning robots made of tetriamonds. During formulation, the cleaning environment is filled with various tiling patterns of the tetriamond-based robot, and each tiling pattern is addressed by a waypoint. The objective is to minimize the amount of shape-shifting needed to fill the workspace. The energy cost function is formulated based on the travel distance between waypoints, which considers the platform locomotion inside the workspace. The objective function is optimized based on evolutionary algorithms such as the genetic algorithm (GA) and ant colony optimization (ACO) of the traveling salesman problem (TSP) and estimates the shortest path that connects all waypoints. The proposed path planning technique can be extended to other polyamond-based reconfigurable robots. Full article

In this paper, a multi-robot persistent coverage of the region of interest is considered, where persistent coverage and cooperative coverage are addressed simultaneously. Previous works have mainly concentrated on the paths that allow for repeated coverage, but ignored the coverage period requirements of each sub-region. In contrast, this paper presents a combinatorial approach for path planning, which aims to cover mission domains with different task periods while guaranteeing both obstacle avoidance and minimizing the number of robots used. The algorithm first deploys the sensors in the region to satisfy coverage requirements with minimum cost. Then it solves the travelling salesman problem to obtain the frame of the closed path. Finally, the approach partitions the closed path into the fewest segments under the coverage period constraints, and it generates the closed route for each robot on the basis of portioned segments of the closed path. Therefore, each robot can circumnavigate one closed route to cover the different task areas completely and persistently. The numerical simulations show that the proposed approach is feasible to implement the cooperative coverage in consideration of obstacles and coverage period constraints, and the number of robots used is also minimized. Full article

The efficiency of autonomous systems that tackle tasks such as home cleaning, agriculture harvesting, and mineral mining depends heavily on the adopted area coverage strategy. Extensive navigation strategies have been studied and developed, but few focus on scenarios with reconfigurable robot agents. This paper proposes a navigation strategy that accomplishes complete path planning for a Tetris-inspired hinge-based self-reconfigurable robot (hTetro), which consists of two main phases. In the first phase, polyomino form-based tilesets are generated to cover the predefined area based on the tiling theory, which generates a series of unsequenced waypoints that guarantee complete coverage of the entire workspace. Each waypoint specifies the position of the robot and the robot morphology on the map. In the second phase, an energy consumption evaluation model is constructed in order to determine a valid strategy to generate the sequence of the waypoints. The cost value between waypoints is formulated under the consideration of the hTetro robot platform’s kinematic design, where we calculate the minimum sum of displacement of the four blocks in the hTetro robot. With the cost function determined, the waypoint sequencing problem is then formulated as a travelling salesman problem (TSP). In this paper, a genetic algorithm (GA) is proposed as a strong candidate to solve the TSP. The GA produces a viable navigation sequence for the hTetro robot to follow and to accomplish complete coverage tasks. We performed an analysis across several complete coverage algorithms including zigzag, spiral, and greedy search to demonstrate that TSP with GA is a valid and considerably consistent waypoint sequencing strategy that can be implemented in real-world hTetro robot navigations. The scalability of the proposed framework allows the algorithm to produce reliable results while navigating within larger workspaces in the real world, and the flexibility of the framework ensures easy implementation of the algorithm on other polynomial-based shape shifting robots. Full article