Basic Search Method: Bidirectional Search
¾çÂÊ¿¡¼ ºÎÅÍ Ã£´Â ¹æ½Ä¿¡ ´ëÇÑ ¼³¸í |
---|
Bidirection search, Áï, µÎ°³ÀÇ ¹æÇ׿¡¼ °Ë»öÇÏ´Â ¹æ½ÄÀº óÀ½ÀÎ ½ÃÀÛ°ú ¸¶Áö¸·
ÀÎ ¸ñÇ¥ ¿¡¼ ºÎÅÍ ÇѴܰè½Ä ¿òÁ÷¿©¼ °°ÀÌ ¸¸³ª´Â Àå¼Ò¿¡¼ ¸ØÃß´Â °Ë»ö
¹æ½ÄÀÔ´Ï´Ù. ÀÌ °Ë»öÀº ½ÃÀÛ°ú ¸ñÇ¥¸¦ ¾Æ´Â »óÅ¿¡¼ °Ë»öÀ» ½ÃÀÛ ÇÏ´Â °ÍÀÔ´Ï´Ù.
ÀÌ °Ë»ö¹æ½ÄÀº °Ë»öÇÏ´Â °¡Áö¼ö(braching factor)¸¦ ÁÙÀÓÀ¸·Î½á ½Ã°£°ú °ø°£À» Breadth-First
¿¡ ºñÇØ ¸¹ÀÌ ÁÙÀϼö ÀÖ½À´Ï´Ù. ¿¹¸¦ µé¸é °¡Áö¼ö(branching factor)°¡ 10ÀÌ°í ±íÀÌ(depth)
°¡ 6ÀÎ Breadth-First¸¦ °Ë»öÇÒ·Á¸é ÃÑ 1,111,111 ¸¦ °Ë»öÇØ¾ß µË´Ï´Ù.
Breadth-First´Â bd¶ó´Â Çü½ÄÀ¸·Î 100 + 101 + 102 +
103 + 104 + 105 + 106 = 1,111,111
ÀÇ °¡Áö¼ö°¡ ÀÖ½À´Ï´Ù. ±×·¯³ª Bidirection °Ë»öÀ» ÀÌ¿ëÇÏ¸é ¾Æ±îÀÇ Breadth-First·ÎÇÑ
°Ë»öÀ» ±íÀÌÀÇ ¹ÝÀ» 2°³·Î ³ª´©±â ¶§¹®¿¡ ÃÑ 2,222 °¡Áö¸¦ °Ë»öÇÕ´Ï´Ù. 2bd/2
À̹ǷΠ100 + 101 + 102 + 103 = 1,111 *
2(¾çÂÊ¿¡¼) = 2,222.
|
±×¸²ÀÇ ¿¹Á¦ |
---|
|
ÀÌ ±×¸²Àº Breadth-First¹æ½ÄÀÇ °Ë»öÀ¸·Î ÆÛÁ®°¡°í ÀÖ½À´Ï´Ù. ½ÃÀÛ(Start)°ú ¸ñÀû(Goal)ÀÌ ÀÖÁö¿ä. ½ÃÀÛ°ú ¸ñÀûÀÌ À̾îÁö¸é ¼º°øÇÑ °ÍÀÔ´Ï´Ù. Áö±Ý ±×¸²Àº À̾îÁú°Í °°Àº »óŸ¦ º¸¿©ÁÜÀ¸·Î½á ¼º°ø°¡±îÀÌ¿¡ ÀÖ½À´Ï´Ù. |
|
»ç¿ëÇÒ¼ö ÀÖ´Â ¿¹¸¦ µé¾îº¸°Ú½À´Ï´Ù. ½ÃÀÛ(Star State)¿¡¼ ¸ñÀû(Goal State) ·Î °¡´Â ¹æ½ÄÀ» ãÀ»¼ö ÀÖ´Â °Ë»öÀ¸·Î »ç¿ëµÇ¾î¼ ¾²¿©Áú¼ö ÀÖ½À´Ï´Ù. ¸ñÀû À» ´Þ¼ºÇϱâ À§Çؼ´Â ¿©·¯°¡Áö ¹æ¹ýÀÌ Àִµ¥, ¿©±â¿¡ ¾²ÀÌ´Â ´Ù¸¥ °Ë»ö ¹æ½Äµé Heuristic Functions µµ °í·ÁÇÏ´Â °Íµµ ÇÊ¿äÇÒ °Í ÀÔ´Ï´Ù. |
¿©±â¿¡ ´ëÇÑ ¿¹Á¦´Â ¾ø½À´Ï´Ù. Á˼ÛÇÕ´Ï´Ù. |
---|
´Ù¸¥ °Ë»ö ¹æ¹ýµé°ú ºñ±³ | ||||||
---|---|---|---|---|---|---|
Criterion |
Breadth-First |
Uniform-Cost |
Depth First |
Depth-Limited |
Iterative Deepening |
Bidirectional |
Time(½Ã°£)
|
bd
|
bd
|
bm
|
bl
|
bd
|
bd/2
|
¿©±â¼ÀÇ b´Â ³ª´©¾îÁö´Â °¡Áö ¼ö. (branching factor)
|
ÀÌ ÀÚ·á´Â Artificial Intelligence, A Modern Approach¿¡¼ °øºÎÇÑ ³»¿ëÁßÀÇ
Çϳª¸¦ Çѱ۷Π¾´°ÍÀÔ´Ï´Ù. Âü°í·Î figure 3.17 ±×¸²Àº Ã¥ 81ÂÊ¿¡¼ º¹»çÇÑ
³»¿ëÀÔ´Ï´Ù. figure 4.7 ±×¸²Àº Ã¥ 101¿¡¼ º¹»çÇÑ ³»¿ëÀÔ´Ï´Ù.
¿©±â¿¡ ´ëÇÑ Áú¹®ÀÌ ÀÖÀ¸½Ã¸é
kee@unforgettable.com À¸·Î ¸ÞÀÏÁÖ½Ã¸é ´äº¯µå¸®°Ú½À´Ï´Ù.