Alpha-N: Shortest Path Finder Automated Delivery Robot with Obstacle Detection and Avoiding System

02/27/2020
by   A. A. Neloy, et al.
0

Alpha N A self-powered, wheel driven Automated Delivery Robot is presented in this paper. The ADR is capable of navigating autonomously by detecting and avoiding objects or obstacles in its path. It uses a vector map of the path and calculates the shortest path by Grid Count Method of Dijkstra Algorithm. Landmark determination with Radio Frequency Identification tags are placed in the path for identification and verification of source and destination, and also for the recalibration of the current position. On the other hand, an Object Detection Module is built by Faster RCNN with VGGNet16 architecture for supporting path planning by detecting and recognizing obstacles. The Path Planning System is combined with the output of the GCM, the RFID Reading System and also by the binary results of ODM. This PPS requires a minimum speed of 200 RPM and 75 seconds duration for the robot to successfully relocate its position by reading an RFID tag. In the result analysis phase, the ODM exhibits an accuracy of 83.75 percent, RRS shows 92.3 percent accuracy and the PPS maintains an accuracy of 85.3 percent. Stacking all these 3 modules, the ADR is built, tested and validated which shows significant improvement in terms of performance and usability comparing with other service robots.

READ FULL TEXT
research
12/07/2021

Pragmatic Implementation of Reinforcement Algorithms For Path Finding On Raspberry Pi

In this paper, pragmatic implementation of an indoor autonomous delivery...
research
12/07/2021

PRM path smoothening by circular arc fillet method for mobile robot navigation

Motion planning and navigation, especially for mobile robots operating i...
research
10/30/2021

AutoDrone: Shortest Optimized Obstacle-Free Path Planning for Autonomous Drones

With technological advancement, drone has emerged as unmanned aerial veh...
research
09/28/2021

Gaussian Belief Space Path Planning for Minimum Sensing Navigation

We propose a path planning methodology for a mobile robot navigating thr...
research
11/15/2022

Multiagent Rollout with Reshuffling for Warehouse Robots Path Planning

Efficiently solving path planning problems for a large number of robots ...
research
09/11/2018

Path Planning Algorithms for a Car-Like Robot visiting a set of Waypoints with Field of View Constraints

This article considers two variants of a shortest path problem for a car...
research
11/16/2018

Information Complexity of Treasure Hunt in Geometric Terrains

Treasure hunt is the task of finding an inert target by a mobile agent i...

Please sign up or login with your details

Forgot password? Click here to reset