Code covered by the BSD License

line_of_sight(observer_state,... Functions determines whether the current target node is visible from the
pathfinder(start_point, end_p... Function finds the shortest path from a start point to an end point in a
pathfinder_test.m
View all files

5.0

5.0 | 1 rating Rate this file 18 Downloads (last 30 days) File Size: 5.32 KB File ID: #33141

Shortest path identification with obstacle avoidance

05 Oct 2011

A set of functions to identify the shortest path between two points inside a closed polygonal arena

File Information
Description	The set of functions are used to identify the shortest path between two points inside a closed polygonal arena. In the case of negotiating an obstacle, the path chosen will be such that it follows the (inflated) obstacle. The function works without the need to discretise the map e.g. by dividing the map into tiles and marking them as walkable or unwalkable.
MATLAB release	MATLAB 7.12 (R2011a)

Tags for This File
Everyone's Tags	artificial intelligence, boundary, dijkstra, maze, maze solver, obstacle, obstacle avoidance(2), robotics, shortest path
Tags I've Applied
Add New Tags	Please login to tag files.

Please login to add a comment or rating.

Comments and Ratings (1)
19 Mar 2012	Deepak