Light detection and ranging (LiDAR) sensors can create high-quality scans of an environment. However, LiDAR point clouds are affected by harsh weather conditions since airborne particles are easily detected. In literature, conventional filtering and artificial intelligence (AI) filtering methods have been used to detect, and remove, airborne particles. In this paper, a convolutional neural network (CNN) model was used to classify airborne dust particles through a voxel-based approach. The CNN model was compared to several conventional filtering methods, where the results show that the CNN filter can achieve up to 5.39 % F1 score improvement when compared to the best conventional filter. All the filtering methods were tested in dynamic environments where the sensor was attached to a mobile platform, the environment had several moving obstacles, and there were multiple dust cloud sources.

The division of a city into several waste collection areas can have a large influence on the workload distribution put in place for the waste collection personnel. Additionally, areas with rapid urban development can benefit from a systematic way to automate the collection area division given that there is geographical information containing stop locations with an approximate number of dwelling units. This paper proposes a 2-stage collection area optimization process using the weighted K-means algorithm paired with differential evolution to minimize the standard deviation of dwelling units across each collection area. Results from a case study in The City of Oshawa, Canada prove that the proposed clustering techniques can yield a set of collection areas with 87.75% improvement compared to the current arrangement in terms of balancing the dwelling units. Additionally, the same clustering techniques can be used to assign collection routes for the vehicles in each area. A combination of Dijkstra’s and Hierholzer’s algorithms is applied to generate a route simulation with accompanying statistics regarding the total distance travelled, collection time, travel time, and fuel consumed. Specific to the case study in The City of Oshawa, each day of the week has 2 collection areas, and a genetic algorithm is used to find the optimal collection area pairs. Results from the collection area pairing show that there is a 38.04% and 37.54% improvement of simulated statistics for Week 1 and 2 collections, respectively.

In recent years, autonomous mobile platforms have seen an increase in usage in several applications. One of which is street-sweeping. Although street-sweeping is a necessary process due to health and cleanliness, fleet operations are difficult to plan optimally. Since each vehicle has several constraints (battery, debris, and water), path planning becomes increasingly difficult to perform manually. Additionally, in real-world applications vehicles may become inactive due to a breakdown, which requires real-time scheduling technology to update the paths for the remaining vehicles. In this paper, the fleet street-sweeping problem can be solved using the proposed lower-level and higher-level path generation methods. For the lower level, a Smart Selective Navigator algorithm is proposed, and a modified genetic algorithm is used for the higher-level path planning. A case study was presented for Uchi Park, South Korea, where the proposed methodology was validated. Specifically, results generated from the ideal scenario (all vehicles operating) were compared to the breakdown scenario, where little to no difference in the overall statistics was observed. Additionally, the lower-level path generation could yield solutions with over 94% area coverage.

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.

As autonomous tractors become more common crop harvesting applications, the need to optimize the global servicing path becomes crucial for maximizing efficiency and crop yield. In recent years, several methods of path generation have been researched, but very few have studied their applications on complex field shapes. In this study, a method of creating the optimal servicing path for simple and complex field shapes is proposed. The proposed algorithm creates subfields for a target land, optimizes the track direction for several subfields individually, merges subfields that result in overall increased efficiency, and finds the minimum non-operating paths to travel from subfield to subfield while selecting the respective optimal subfield starting locations. Additionally, it is required that this process must be done within 3 seconds to meet performance requirements. Results from 3 separate field shapes show that the field traversal efficiency can range from 68.0% to 94.4%, and the coverage ratio can range from 98.8% to 99.9% for several different conditions. In comparison with previous studies using the same field shape, the proposed methods demonstrate an increase of 5.5% in field traversal efficiency.