Visual localization is a crucial component in the application of mobile robot and autonomous *** retrieval is an efficient and effective technique in image-based localization *** to the drastic variability of environm...
详细信息
Visual localization is a crucial component in the application of mobile robot and autonomous *** retrieval is an efficient and effective technique in image-based localization *** to the drastic variability of environmental conditions,e.g.,illumination changes,retrievalbased visual localization is severely affected and becomes a challenging *** this work,a general architecture is first formulated probabilistically to extract domain-invariant features through multi-domain image ***,a novel gradientweighted similarity activation mapping loss(Grad-SAM)is incorporated for finer localization with high *** also propose a new adaptive triplet loss to boost the contrastive learning of the embedding in a self-supervised *** final coarse-to-fine image retrieval pipeline is implemented as the sequential combination of models with and without Grad-SAM *** experiments have been conducted to validate the effectiveness of the proposed approach on the CMU-Seasons *** strong generalization ability of our approach is verified with the RobotCar dataset using models pre-trained on urban parts of the CMU-Seasons *** performance is on par with or even outperforms the state-of-the-art image-based localization baselines in medium or high precision,especially under challenging environments with illumination variance,vegetation,and night-time ***,real-site experiments have been conducted to validate the efficiency and effectiveness of the coarse-to-fine strategy for localization.
In this paper, a new distributed allocation algorithm based on performance impact with collective influence (PI-CI) is proposed. Considering inefficiency of creating time slots in PI-MaxAss, two completely independent...
详细信息
ISBN:
(数字)9789887581598
ISBN:
(纸本)9798331540845
In this paper, a new distributed allocation algorithm based on performance impact with collective influence (PI-CI) is proposed. Considering inefficiency of creating time slots in PI-MaxAss, two completely independent phases with different communication frequencies are designed to ensure allocation both real-time and conflict-free under limited communication. To solve the misconvergence of the baseline algorithm PI-MaxAss in allocation results, an evaluation function is put forward in consensus phase to directly determines the final attribution of repeatedly assigned tasks, guaranteeing convergence of allocation. Comparison experiments validate the performance improvement of the PI-CI algorithm over the baseline algorithm.
Blended learning integrates online and face-to-face (FTF) teaching methods to offer students in higher education a flexible and customized educational experience. Despite its significant advantages in promoting academ...
详细信息
In the field of electromagnetic radiation source location, using UAVs to locate the radiation source target has become a new location method. At present, the UAV swarm cooperative optimization method for high-precisio...
详细信息
Automatic defect detection on wood surface is essential for ensuring product quality. Semantic segmentation methods have shown outstanding performance in wood defect detection. However, it is costly to acquire correct...
详细信息
Using machine vision for meter reading significantly enhances the efficiency of industrial monitoring. However, meters in outdoor environment are often subject to the noise such as rain and fog, which affect the accur...
详细信息
In this paper, we consider the multi-agent path planning problem for high-level tasks with finite horizons. In many situations, there is the need to count how many times a sub-task is satisfied in order to achieve the...
详细信息
ISBN:
(数字)9798350358513
ISBN:
(纸本)9798350358520
In this paper, we consider the multi-agent path planning problem for high-level tasks with finite horizons. In many situations, there is the need to count how many times a sub-task is satisfied in order to achieve the overall task. However, existing temporal logic languages, such as linear temporal logic, may not be efficient in describing such requirements. To address this issue, we propose a new temporal logic language called Counting Time Temporal Logic (CTTL) that extends linear temporal logic by explicitly counting the number of times that some tasks are satisfied. To solve the CTTL path planning problem, we use integer linear programming to encode the satisfaction of the task. We demonstrate that our approach is both sound and complete. To validate our results, we present numerical experiments to show the scalability of the proposed approach. Furthermore, we provide a simulation case study of a team of autonomous robots to illustrate the synthesis procedure.
Different from the traditional warehousing system, in the multi-AGV warehouse scheduling controlsystem, the constraints of poor connectivity of the conveying track have led to the emergence of urgent problems such as...
详细信息
The development of the Industrial Internet of Things (IIoT) is increasingly relying on the low-latency and low-jitter information exchange. Time-Sensitive Networking (TSN) guarantees the deterministic transmission by ...
详细信息
In urban driving scenarios,owing to the presence of multiple static obstacles such as parked cars and roadblocks,planning a collision-free and smooth path remains a challenging *** addition,the path-planning problem i...
详细信息
In urban driving scenarios,owing to the presence of multiple static obstacles such as parked cars and roadblocks,planning a collision-free and smooth path remains a challenging *** addition,the path-planning problem is mostly non-convex,and contains multiple local ***,a method for combining a sampling-based method and an optimization-based method is proposed in this paper to generate a collision-free path with kinematic constraints for urban *** sampling-based method constructs a search graph to search for a seeding path for exploring a safe driving corridor,and the optimization-based method constructs a quadratic programming problem considering the desired state constraints,continuity constraints,driving corridor constraints,and kinematic constraints to perform path *** experimental results show that the proposed method is able to plan a collision-free and smooth path in real time when managing typical urban scenarios.
暂无评论