{"id":26522387,"url":"https://github.com/juanfran24/path_planner_robot","last_synced_at":"2026-05-17T09:36:02.879Z","repository":{"id":283577881,"uuid":"952047781","full_name":"Juanfran24/path_planner_robot","owner":"Juanfran24","description":"Miniproyecto para la asignatura Inteligencia Artificial sobre planificador de rutas para robots usando el algoritmo A* que busca encontrar la ruta más corta desde un punto de inicio a fin en un grafo 2D.","archived":false,"fork":false,"pushed_at":"2025-03-21T01:17:36.000Z","size":2,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-21T01:23:34.345Z","etag":null,"topics":["a-star-algorithm","ia","python"],"latest_commit_sha":null,"homepage":"","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Juanfran24.png","metadata":{"files":{"readme":"README.txt","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2025-03-20T16:43:29.000Z","updated_at":"2025-03-21T01:17:39.000Z","dependencies_parsed_at":"2025-03-21T01:23:37.215Z","dependency_job_id":null,"html_url":"https://github.com/Juanfran24/path_planner_robot","commit_stats":null,"previous_names":["juanfran24/path_planner_robot"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Juanfran24%2Fpath_planner_robot","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Juanfran24%2Fpath_planner_robot/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Juanfran24%2Fpath_planner_robot/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Juanfran24%2Fpath_planner_robot/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Juanfran24","download_url":"https://codeload.github.com/Juanfran24/path_planner_robot/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":244805143,"owners_count":20513227,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["a-star-algorithm","ia","python"],"created_at":"2025-03-21T13:26:51.307Z","updated_at":"2025-10-26T20:41:21.081Z","avatar_url":"https://github.com/Juanfran24.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Planificación de Rutas para Robots con A*\n\n## Descripción\nEste proyecto implementa un sistema de planificación de rutas para un robot en un entorno 2D con obstáculos generados aleatoriamente. Utiliza el algoritmo A* para encontrar la ruta más corta desde un punto de inicio hasta un destino evitando obstáculos.\n\n## Requisitos\nPara ejecutar el proyecto, asegúrate de tener instalado **Python 3.x** y las siguientes librerías:\n\n```bash\npip install matplotlib networkx\n```\n\n## Cómo ejecutar el proyecto\n1. Clona este repositorio o descarga los archivos.\n2. Abre una terminal en la carpeta del proyecto.\n3. Ejecuta el script principal:\n\n```bash\npython main.py\n```\n\n## Funcionamiento\n- Se genera una cuadrícula de 10x10 representando el entorno.\n- Se añaden obstáculos en posiciones aleatorias.\n- El robot parte de la posición (0,0) y debe llegar a (9,9).\n- Se usa el algoritmo A* con la heurística de Manhattan para encontrar la mejor ruta.\n- Se muestra una visualización con el camino óptimo, obstáculos y nodos del grafo.\n\n## Archivos principales\n- **main.py**: Código principal del proyecto.\n- **README.md**: Este archivo con la descripción y guía de uso.\n\n## Mejoras futuras\n- Permitir movimientos diagonales con heurística euclidiana.\n- Optimizar el tiempo de ejecución en entornos más grandes.\n- Implementar una interfaz gráfica para mayor interacción.\n\n## Autor\nDesarrollado por Juan Esteban Franco Estacio.\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjuanfran24%2Fpath_planner_robot","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fjuanfran24%2Fpath_planner_robot","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjuanfran24%2Fpath_planner_robot/lists"}