Difference between revisions of "Targeting"
m |
m (Simplification) |
||
(6 intermediate revisions by 5 users not shown) | |||
Line 1: | Line 1: | ||
− | In Robocode, | + | {{Youtube|sWFMhIiMyh8}} |
+ | |||
+ | In Robocode, your goal is to deplete your opponent's energy, increase your own energy, and collect points by hitting other bots with bullets. For info about bullet damage and scoring, see [[Robocode/Game Physics]] and [[Robocode/Scoring]]. | ||
The main components of a targeting system are: | The main components of a targeting system are: | ||
− | |||
− | |||
− | |||
− | Most descriptions of Robocode targeting systems focus on choosing a firing angle. | + | * '''Choosing a target''' ([[Melee]] only) ‒ Find the right balance of conserving energy, collecting bullet damage points, picking off easy targets, and killing bots that are dangerous to you. |
+ | * '''[[Energy Management]]''' ‒ Choosing the right bullet power, or whether to fire or conserve your energy. | ||
+ | * '''Choosing a firing angle''' ‒ The crux of Robocode targeting. | ||
+ | |||
+ | == Targeting as a classification problem == | ||
+ | |||
+ | Most descriptions of Robocode targeting systems focus on choosing a firing angle. This is essentially a [[wikipedia:Statistical classification|classification problem]]. The enemy robot can't react to where you fire your bullets because he can't see your gun or your bullets (until/unless they hit him or one of his bullets). He can, however, see when you fire by monitoring your energy. | ||
Some aspects that make Robocode targeting an interesting classification problem are: | Some aspects that make Robocode targeting an interesting classification problem are: | ||
− | * You have a very small amount of time per tick to make a decision. Dropping in the most sophisticated classification algorithm you can find in a textbook won't work. | + | * You have a very small amount of time per tick to make a decision. Dropping in the most sophisticated classification algorithm you can find in a textbook won't work. The time you have needs to be split between collecting data and generating firing angles. |
− | * You have to continually make decisions | + | * You have to continually make decisions with a changing data set. When you have no data, when you have 50 ticks, 500 ticks, or 20,000 ticks of data, your algorithm has to perform well and remain fast. |
+ | * Improving a classification algorithm is hard. Some of the biggest advancements come from insights into collecting data accurately and how inputs and outputs are represented, like [[GuessFactor]]s, innovative wall distance measurements, [[Maximum Escape Angle/Precise|precise max escape angles]], [[Waves/Precise Intersection|precise wave intersection]], and [[Virtual Guns|choosing the right gun]]. | ||
+ | |||
+ | == Common gun configurations == | ||
+ | Some of the most common learning gun configurations are (in order of effectiveness and complexity): | ||
+ | * '''[[Head-On Targeting]]''' ‒ Shoot at where you last saw your enemy. Useless against anything that moves in a single direction most of the time. It, however, works surprisingly well against Oscillator Movement and sometimes random movement. | ||
+ | * '''[[Circular Targeting]]''' ‒ Assume the enemy will continue moving and turning with the same velocity/turnrate that he is right now, and shoot there. | ||
+ | * '''[[Pattern Matching]] with [[Play It Forward]]''' ‒ Use the enemy's recent movements as the input, find a time in the past when his relative movements were similar, and guess that he will continue in the same fashion as he did in the most similar previous situation. | ||
+ | * '''[[GuessFactor Targeting (traditional)|Traditional GuessFactor Targeting]] ([[Segmentation|Segmentated]] [[Visit Count Stats]] with [[GuessFactors]])''' ‒ Choose a few attributes to describe firing situations, segment them into a multi-dimensional array that covers all possible situation, and tally the hitting GuessFactor in each situation encountered (like a multivariate [[wikipedia:Histogram|histogram]]). At fire time, fire at the most often visited GuessFactor for the segment describing the current situation. | ||
+ | * '''[[Dynamic Clustering]] with [[GuessFactors]]''' ‒ Choose a few attributes to describe firing situations, log the attributes and hitting GuessFactor for every situation encountered. At fire time, choose some number (''k'') of similar situations from your log, and find the densest area of the graph of the corresponding GuessFactors. | ||
+ | |||
+ | == FAQ == | ||
+ | ; What's the difference between [[GuessFactors]] and [[Play It Forward]]? | ||
+ | : GF targeting means choosing a (normalized) angle, and shooting at it. PIF targeting means picking a point, and shooting at it. | ||
− | |||
− | |||
− | |||
− | |||
+ | {{Targeting Navbox}} | ||
[[Category:Targeting]] | [[Category:Targeting]] |
Latest revision as of 00:16, 28 August 2017
In Robocode, your goal is to deplete your opponent's energy, increase your own energy, and collect points by hitting other bots with bullets. For info about bullet damage and scoring, see Robocode/Game Physics and Robocode/Scoring.
The main components of a targeting system are:
- Choosing a target (Melee only) ‒ Find the right balance of conserving energy, collecting bullet damage points, picking off easy targets, and killing bots that are dangerous to you.
- Energy Management ‒ Choosing the right bullet power, or whether to fire or conserve your energy.
- Choosing a firing angle ‒ The crux of Robocode targeting.
Targeting as a classification problem
Most descriptions of Robocode targeting systems focus on choosing a firing angle. This is essentially a classification problem. The enemy robot can't react to where you fire your bullets because he can't see your gun or your bullets (until/unless they hit him or one of his bullets). He can, however, see when you fire by monitoring your energy.
Some aspects that make Robocode targeting an interesting classification problem are:
- You have a very small amount of time per tick to make a decision. Dropping in the most sophisticated classification algorithm you can find in a textbook won't work. The time you have needs to be split between collecting data and generating firing angles.
- You have to continually make decisions with a changing data set. When you have no data, when you have 50 ticks, 500 ticks, or 20,000 ticks of data, your algorithm has to perform well and remain fast.
- Improving a classification algorithm is hard. Some of the biggest advancements come from insights into collecting data accurately and how inputs and outputs are represented, like GuessFactors, innovative wall distance measurements, precise max escape angles, precise wave intersection, and choosing the right gun.
Common gun configurations
Some of the most common learning gun configurations are (in order of effectiveness and complexity):
- Head-On Targeting ‒ Shoot at where you last saw your enemy. Useless against anything that moves in a single direction most of the time. It, however, works surprisingly well against Oscillator Movement and sometimes random movement.
- Circular Targeting ‒ Assume the enemy will continue moving and turning with the same velocity/turnrate that he is right now, and shoot there.
- Pattern Matching with Play It Forward ‒ Use the enemy's recent movements as the input, find a time in the past when his relative movements were similar, and guess that he will continue in the same fashion as he did in the most similar previous situation.
- Traditional GuessFactor Targeting (Segmentated Visit Count Stats with GuessFactors) ‒ Choose a few attributes to describe firing situations, segment them into a multi-dimensional array that covers all possible situation, and tally the hitting GuessFactor in each situation encountered (like a multivariate histogram). At fire time, fire at the most often visited GuessFactor for the segment describing the current situation.
- Dynamic Clustering with GuessFactors ‒ Choose a few attributes to describe firing situations, log the attributes and hitting GuessFactor for every situation encountered. At fire time, choose some number (k) of similar situations from your log, and find the densest area of the graph of the corresponding GuessFactors.
FAQ
- What's the difference between GuessFactors and Play It Forward?
- GF targeting means choosing a (normalized) angle, and shooting at it. PIF targeting means picking a point, and shooting at it.
|