root / scout / libscout / src / behaviors / navigationMap.h @ d37cfc69
History | View | Annotate | Download (4.51 KB)
1 | 2d697b1f | Leon | /**
|
---|---|---|---|
2 | * Copyright (c) 2011 Colony Project
|
||
3 | *
|
||
4 | * Permission is hereby granted, free of charge, to any person
|
||
5 | * obtaining a copy of this software and associated documentation
|
||
6 | * files (the "Software"), to deal in the Software without
|
||
7 | * restriction, including without limitation the rights to use,
|
||
8 | * copy, modify, merge, publish, distribute, sublicense, and/or sell
|
||
9 | * copies of the Software, and to permit persons to whom the
|
||
10 | * Software is furnished to do so, subject to the following
|
||
11 | * conditions:
|
||
12 | *
|
||
13 | * The above copyright notice and this permission notice shall be
|
||
14 | * included in all copies or substantial portions of the Software.
|
||
15 | *
|
||
16 | * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
||
17 | * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
|
||
18 | * OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
||
19 | * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
|
||
20 | * HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
||
21 | * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
|
||
22 | * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
|
||
23 | * OTHER DEALINGS IN THE SOFTWARE.
|
||
24 | */
|
||
25 | |||
26 | /**
|
||
27 | * @file navigationMap.h
|
||
28 | * @brief Contains navigation map Behavior declarations and definitions
|
||
29 | *
|
||
30 | * Contains functions and definitions for the use of
|
||
31 | * navigation map Behavior
|
||
32 | *
|
||
33 | * @author Colony Project, CMU Robotics Club
|
||
34 | * @author Priya Deo
|
||
35 | * @author Lalitha
|
||
36 | * @author James
|
||
37 | * @author Leon
|
||
38 | **/
|
||
39 | |||
40 | d8caf546 | Priya | #ifndef _NAVIGATION_MAP_
|
41 | #define _NAVIGATION_MAP_
|
||
42 | |||
43 | #include <cstdlib> |
||
44 | aa5e4ddc | Leon | #include <queue> |
45 | cccc25c9 | Priya | #include "../Behavior.h" |
46 | //#include "lineDrive.h" // Get turn Macros
|
||
47 | |||
48 | 2d697b1f | Leon | /** Turn defintions */
|
49 | cccc25c9 | Priya | #define ISTRAIGHT 0 |
50 | #define ILEFT 1 |
||
51 | #define IRIGHT 2 |
||
52 | #define IUTURN 3 |
||
53 | d8caf546 | Priya | |
54 | #define START_STATE 1 |
||
55 | |||
56 | 6642eee3 | Priya | #define DEADEND 255 |
57 | d8caf546 | Priya | #define ARRAY_SIZE 3 |
58 | 93210a92 | Leon | #define MAX_NODES 12 |
59 | cc399ab3 | Priya | |
60 | #define SPEED 10 //distance_unit per s |
||
61 | #define DROPOFF_TIME 10 //seconds |
||
62 | #define TURN_TIME 3 //Seconds |
||
63 | #define NUM_ROBOTS 2 |
||
64 | #define WAIT_TIME (TURN_TIME * NUM_ROBOTS) //Seconds |
||
65 | 2d697b1f | Leon | |
66 | /** used to extract information from an encoded Edge */
|
||
67 | d8caf546 | Priya | #define GET_EDGE_DIR(edge) ((edge)&0x3) |
68 | #define GET_EDGE_STATE(edge) (((edge)>>2)&0xFF) |
||
69 | #define GET_EDGE_DIST(edge) (((edge)>>10)&0x3FFFFF) |
||
70 | |||
71 | 2d697b1f | Leon | /** used to change or build an Edge's information */
|
72 | d8caf546 | Priya | #define SET_EDGE_DIR(dir) ((dir)&0x3) |
73 | #define SET_EDGE_STATE(state) (((state)&0xFF)<<2) |
||
74 | #define SET_EDGE_DIST(dist) (((dist)&0x3FFFFF)<<10) |
||
75 | |||
76 | #define MAKE_EDGE(dir, state, dist) \
|
||
77 | 738e44fb | Priya | SET_EDGE_DIR(dir)+SET_EDGE_STATE(state)+SET_EDGE_DIST(dist) |
78 | |||
79 | 2d697b1f | Leon | /** an integer with a direction, an associated state, and distance
|
80 | * encoded into its bits*/
|
||
81 | cc399ab3 | Priya | typedef unsigned int Edge; |
82 | 2d697b1f | Leon | |
83 | /** a simple number representing the number of a node*/
|
||
84 | 6642eee3 | Priya | typedef unsigned int State; |
85 | 2d697b1f | Leon | |
86 | /** a number representing a type of turn, as defined above*/
|
||
87 | cc399ab3 | Priya | typedef unsigned int Turn; |
88 | d8caf546 | Priya | |
89 | 2d697b1f | Leon | /** a list of turns to follow a path */
|
90 | 738e44fb | Priya | typedef struct{ |
91 | int len;
|
||
92 | Turn* path; |
||
93 | } Path; |
||
94 | |||
95 | d8caf546 | Priya | class navigationMap : Behavior |
96 | { |
||
97 | d37cfc69 | Leon | /** ASCII Representation of the map
|
98 | *
|
||
99 | * 1 2 3 4
|
||
100 | * ----|-----------|----------|---------|---------->
|
||
101 | * <---|--5--------|--6-------|--7------|--8-------
|
||
102 | * | | | |
|
||
103 | * 9| 10| 11| 12|
|
||
104 | * | | | |
|
||
105 | * --- --- --- ---
|
||
106 | */
|
||
107 | |||
108 | 738e44fb | Priya | public:
|
109 | 2d697b1f | Leon | /** Initializes the navigation map */
|
110 | 738e44fb | Priya | navigationMap(std::string scoutname); |
111 | 2d697b1f | Leon | /** Goes through and frees all allocated memory */
|
112 | 738e44fb | Priya | ~navigationMap(); |
113 | |||
114 | 2d697b1f | Leon | /** FSM implementation */
|
115 | 738e44fb | Priya | void run();
|
116 | 2d697b1f | Leon | |
117 | /** sets the current state to the state associated with the turn made */
|
||
118 | 738e44fb | Priya | State update_state(Turn turn_made); |
119 | |||
120 | 2d697b1f | Leon | /** returns the predicted time of arrival for our current task */
|
121 | 738e44fb | Priya | Time get_eta(); |
122 | 2d697b1f | Leon | /** returns the predicted amount of time it will take to finish our task */
|
123 | cccc25c9 | Priya | Duration get_time_remaining(); |
124 | 738e44fb | Priya | |
125 | 2d697b1f | Leon | /** returns the Edges connecting from a given State */
|
126 | Edge* get_outbound_edges(State state); |
||
127 | |||
128 | /** returns the current state of the scout in the map*/
|
||
129 | 738e44fb | Priya | State get_state(); |
130 | 2d697b1f | Leon | /** uses BFS to find the shortest path to a target State node */
|
131 | cc399ab3 | Priya | Path shortest_path(State start_state, State target_state); |
132 | 738e44fb | Priya | Path shortest_path(State target_state); |
133 | |||
134 | cc399ab3 | Priya | /** returns the predicted worst case time it will take to travel from src to dest nodes */
|
135 | Duration get_worst_case_time(State start_state, State target_state); |
||
136 | |||
137 | 738e44fb | Priya | private:
|
138 | 2d697b1f | Leon | /** the dynamic array of edge arrays representing individual State nodes */
|
139 | cccc25c9 | Priya | std::vector <Edge*> map; |
140 | 2d697b1f | Leon | /** the current State node */
|
141 | 738e44fb | Priya | State curr_state; |
142 | 2d697b1f | Leon | /** the predicted time of arrival for our current task */
|
143 | 738e44fb | Priya | Time arrival_time; |
144 | d8caf546 | Priya | }; |
145 | #endif |