Abstract
Consider an example of a search problem. Here, and in the following chapters, we call it the 2D/4A problem. This is a problem of simplified air combat with four aircraft and 2D operational district. We will show how to solve this problem employing the LG approach. The chosen problem is simple enough to be used as the first demonstration of the LG approach. Nevertheless, it is not trivial and requires significant search to be solved employing conventional approaches.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Stilman, B. (2000). Robot Combat for 2D District. In: Linguistic Geometry. Operations Research/Computer Science Interfaces Series, vol 13. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-4439-5_3
Download citation
DOI: https://doi.org/10.1007/978-1-4615-4439-5_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6999-8
Online ISBN: 978-1-4615-4439-5
eBook Packages: Springer Book Archive