Learn More
Location based Services offer many advantages to the mobile users to retrieve the information about their current location and process that data to get more useful information near to their location. With the help of A-GPS in phones and through Web Services using GPRS, Location based Services can be implemented on Android based smart phones to provide these(More)
The pace of development and automation urge the need of robots controlling much of the work which used to be done mainly by humans. The modern technology has emphasized on the need to move a robot in an environment which is dynamically changing. An example of such an application may be the use of robots in industry to carry tools and other materials from(More)
Robotic Path planning is one of the most studied problems in the field of robotics. The problem has been solved using numerous statistical, soft computing and other approaches. In this paper we solve the problem of robotic path planning using a combination of A* algorithm and Fuzzy Inference. The A* algorithm does the higher level planning by working on a(More)
The problem of path planning deals with the computation of an optimal path of the robot, from source to destination, such that it does not collide with any obstacle on its path. In this paper we solve the problem of path planning separately in two hierarchies. The coarser hierarchy finds the path in a static environment consisting of the entire robotic map.(More)
We know the various searching algorithms available today. Searching has become one of the most essential parts of the artificial intelligence algorithms these days. We have so many algorithms like A*, Heuristic Search, Breadth-First Search, Depth First Search, etc. All these are applied to various problems in their own way. We need to predict the most(More)
Path Planning is a classical problem in the field of robotics. The problem is to find a path of the robot given the various obstacles. The problem has attracted the attention of numerous researchers due to the associated complexities, uncertainties and real time nature. In this paper we propose a new algorithm for solving the problem of path planning in a(More)
In this paper we propose a new algorithm to solve the problem of robotic path planning in static environment where the source and destination are given. A grid-based map has been used to represent the robotic world. The basic algorithm is built on an evolutionary approach, where the path evolves along with generations with each generation adding to the(More)
Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in(More)
Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in(More)