Borrar filtros
Borrar filtros

I have question related to occupied and non occupied spaces in MATLAB.

1 visualización (últimos 30 días)
My research is related to finding the optimal path via avoiding obstacles. I have created random obstacles and a target with robot start point as well.
I just wanted to know how can I find that a box in a graph is occupied or not.
I wanted to check which places in a graph is filled. Like if it is filled than It can be set as 1 otherwise 0.
0= not occupied
1=occupied.
Kindly help in this regard.
  5 comentarios
Image Analyst
Image Analyst el 27 de Dic. de 2018
Does the robot know the locations of the obstacles in advance, or does it have to discover them as it moves. If it has to discover them, how far (how many grid points) can it see away from its current location?
passioncoding
passioncoding el 28 de Dic. de 2018
Right now I have just created random obstacles in grid based graph and one goal and other robot. ( created an arrow and circle to show the robot). I can implement A star algorithm to search for shortest path with the help of grid points.
And right now robot doesnot know where obstacles are it has to discover them when it moves. and thats why I am asking this question.
I have thought that ,those grid boxes which contain obstacles are defined as occupied spaces and empty ones as non-occupied. According to which algorithm can be written to search for path with short distance.

Iniciar sesión para comentar.

Respuesta aceptada

Image Analyst
Image Analyst el 28 de Dic. de 2018

Más respuestas (0)

Categorías

Más información sobre Graph and Network Algorithms en Help Center y File Exchange.

Etiquetas

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by