{"type":"ScholarlyArticle","title":"Moving Target Search","authors":[{"name":"Toru Ishida","slug":"toru-ishida","given":"Toru","family":"Ishida","affiliation":""},{"name":"Richard E. Korf","slug":"richard-e-korf","given":"Richard E.","family":"Korf","affiliation":""}],"abstract":"We consider the case of heuristic search where the location of the goal may change during the course of the search. For example, the goal may be a target that is actively avoiding the problem solver. We present a moving target search algorithm (MTS} to solve this problem. We prove that if the average speed of the target is slower than that of the problem solver, then the problem solver is guaranteed to eventually reach the target. An implementation with randomly positioned obstacles confirms that the MTS algorithm is highly effective in various situations.","doi":null,"url":"https://ijcai.org/proceedings/1991/31","pdf":"https://ijcai.org/proceedings/1991/0031.pdf","markdown":"https://ijcai.org/proceedings/1991/31.md","bibtex":"https://ijcai.org/proceedings/1991/bibtex/31","volume":{"slug":"1991","title":"Proceedings of the Twelfth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1991","url":"https://ijcai.org/proceedings/1991/","year":1991,"location":"Sydney, New South Wales, Australia","dates":"24-30 August 1991","editors":"John Mylopoulos and Ray Reiter","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Automated Reasoning","track":"Automated Reasoning","number":31,"pages":{"first":204,"last":210},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}