Shortest  Path  Finding  Problem

À§ÀÇ ±×·¡ÇÁ¿¡¼­ A¿¡¼­ Z±îÁö °¡´Â ÃÖ´Ü path¸¦ ã´Â ¹®Á¦ÀÌ´Ù. ±×·¡ÇÁ¿¡¼­ shortest path¸¦ ã´Â ¹®Á¦´Â ³î¶ó¿ì¸® ¸¸Å­ ¸¹Àº ºÐ¾ß¿¡¼­ ÀÀ¿ëµÈ´Ù.

term :

±×·¡ÇÁ (Graph)   °ÔÀÓ (Game)   Å½»ö (Search)    ÈÞ¸®½ºÆ½ (Heuristic)   ¼øȸÆǸſø ¹®Á¦ (Traveling Salesman Problem)    °è»êº¹ÀâµµÀÌ·Ð (Computational Complexity Theory)   ÃÖ´Ü°æ·Î ã±â ¹®Á¦ (Shortest Path Finding Problem)   ¹®Á¦ÇØ°á (Problem Solving)   ÈÞ¸®½ºÆ½ Ž»ö (Heuristic Search)   ÃÖ»ó¿ì¼± Ž»ö (Best-first Search)   A * ¾Ë°í¸®Áò     Edsger W. Dijkstra

site :

Wikipedia : Shortest path problem

Shortest Path Problem Web Pages

Shortest Path  :  Stony Brook ¾Ë°í¸®Áò ÀÚ·á½Ç : ´º¿å ÁÖ¸³´ë

Minimum cost spanning tree for Path finding problem : CMU

Path Finding : Stanford : Amit ÀÇ °ÔÀÓ ÇÁ·Î±×·¥ »çÀÌÆ®, A*¾Ë°í¸®ÁòÀ» »ç¿ëÇÑ Path Finding ÇØ°á.

Real Time Search for Path Finding (PDF file): WPI

path :

´ÙÁß µ¿Àû±¸°£ ´ë±âÇà·ÄÀ» ÀÌ¿ëÇÑ ÃÖ´Ü°æ·Î Ž»ö¾Ë°í¸®Áò (Shortest Path-Finding Algorithm using Multiple Dynamic-Range Queue ( MDRQ )) : ±èÅÂÁø, ÇѹÎÈ«, Çѱ¹Á¤º¸Ã³¸®ÇÐȸ, 2001

¹Ì·Îȯ°æ¿¡¼­ ÃÖ´Ü°æ·Î Ž»öÀ» À§ÇÑ ½Ç½Ã°£ °­È­ÇнÀ (Online Reinforcement Learning to Search the Shortest Path in Maze Environments) : ±èº´Ãµ, ±è»ï±Ù, À±º´ÁÖ, Çѱ¹Á¤º¸Ã³¸®ÇÐȸ, 2002

Ant Colony System¿¡¼­ È¿À²Àû °æ·Î Ž»öÀ» À§ÇÑ Áö¿ª°»½Å°ú Àü¿ª°»½Å¿¡¼­ÀÇ Ãß°¡ °­È­¿¡ °üÇÑ ¿¬±¸ (A Study about Additional Reinforcement in Local Updating and Global Updating for Efficient Path Search in Ant Colony System) : À̽°ü, Á¤ÅÂÃæ, Çѱ¹Á¤º¸Ã³¸®ÇÐȸ, 2003

SOM (Self-Organization Map) À» ÀÌ¿ëÇÑ ·Îº¿ ¸Å´Ïǽ·¹ÀÌÅÍ Ã浹ȸÇÇ °æ·Î°èȹ (Collision-Free Path Planning for Robot Manipulator using SOM) : ÀÌÁ¾ÅÂ, ÀÌÁ¾¿ì, ´ëÇÑ»ê¾÷°øÇÐȸ, 1996