1 // trafficrecord.cxx - Implementation of AIModels ATC code.
3 // Written by Durk Talsma, started September 2006.
5 // Copyright (C) 2006 Durk Talsma.
7 // This program is free software; you can redistribute it and/or
8 // modify it under the terms of the GNU General Public License as
9 // published by the Free Software Foundation; either version 2 of the
10 // License, or (at your option) any later version.
12 // This program is distributed in the hope that it will be useful, but
13 // WITHOUT ANY WARRANTY; without even the implied warranty of
14 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 // General Public License for more details.
17 // You should have received a copy of the GNU General Public License
18 // along with this program; if not, write to the Free Software
19 // Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
27 #include "trafficcontrol.hxx"
28 #include <AIModel/AIFlightPlan.hxx>
31 /***************************************************************************
33 **************************************************************************/
34 void FGTrafficRecord::setPositionAndIntentions(int pos, FGAIFlightPlan *route)
38 if (intentions.size()) {
39 intVecIterator i = intentions.begin();
41 SG_LOG(SG_GENERAL, SG_ALERT, "Error in FGTrafficRecord::setPositionAndIntentions");
42 cerr << "Pos : " << pos << " Curr " << *(intentions.begin()) << endl;
43 for (intVecIterator i = intentions.begin(); i != intentions.end() ; i++) {
51 //FGAIFlightPlan::waypoint* const wpt= route->getCurrentWaypoint();
52 int size = route->getNrOfWayPoints();
53 //cerr << "Setting pos" << pos << " ";
54 //cerr << "setting intentions ";
55 for (int i = 0; i < size; i++) {
56 int val = route->getRouteIndex(i);
58 if ((val) && (val != pos))
60 intentions.push_back(val);
65 //while (route->next(&legNr, &routeNr)) {
66 //intentions.push_back(routeNr);
68 //route->rewind(currentPos);
73 bool FGTrafficRecord::checkPositionAndIntentions(FGTrafficRecord &other)
76 //cerr << "Start check 1" << endl;
77 if (currentPos == other.currentPos)
79 //cerr << "Check Position and intentions: current matches" << endl;
82 // else if (other.intentions.size())
84 // cerr << "Start check 2" << endl;
85 // intVecIterator i = other.intentions.begin();
86 // while (!((i == other.intentions.end()) || ((*i) == currentPos)))
88 // if (i != other.intentions.end()) {
89 // cerr << "Check Position and intentions: current matches other.intentions" << endl;
92 else if (intentions.size()) {
93 //cerr << "Start check 3" << endl;
94 intVecIterator i = intentions.begin();
95 //while (!((i == intentions.end()) || ((*i) == other.currentPos)))
96 while (i != intentions.end()) {
97 if ((*i) == other.currentPos) {
102 if (i != intentions.end()) {
103 //cerr << "Check Position and intentions: .other.current matches" << endl;
107 //cerr << "Done !!" << endl;
111 void FGTrafficRecord::setPositionAndHeading(double lat, double lon, double hdg,
112 double spd, double alt)
121 int FGTrafficRecord::crosses(FGGroundNetwork *net, FGTrafficRecord &other)
123 if (checkPositionAndIntentions(other) || (other.checkPositionAndIntentions(*this)))
126 int currentTargetNode = 0, otherTargetNode = 0;
128 currentTargetNode = net->findSegment(currentPos )->getEnd()->getIndex(); // OKAY,...
129 if (other.currentPos > 0)
130 otherTargetNode = net->findSegment(other.currentPos)->getEnd()->getIndex(); // OKAY,...
131 if ((currentTargetNode == otherTargetNode) && currentTargetNode > 0)
132 return currentTargetNode;
133 if (intentions.size())
135 for (i = intentions.begin(); i != intentions.end(); i++)
138 if ((currentTargetNode == net->findSegment(*i)->getEnd()->getIndex()))
140 cerr << "Current crosses at " << currentTargetNode <<endl;
141 return currentTargetNode;
146 if (other.intentions.size())
148 for (i = other.intentions.begin(); i != other.intentions.end(); i++)
151 if (otherTargetNode == net->findSegment(*i)->getEnd()->getIndex())
153 cerr << "Other crosses at " << currentTargetNode <<endl;
154 return otherTargetNode;
159 if (intentions.size() && other.intentions.size())
161 for (i = intentions.begin(); i != intentions.end(); i++)
163 for (j = other.intentions.begin(); j != other.intentions.end(); j++)
165 //cerr << "finding segment " << *i << " and " << *j << endl;
166 if (((*i) > 0) && ((*j) > 0)) {
167 currentTargetNode = net->findSegment(*i)->getEnd()->getIndex();
168 otherTargetNode = net->findSegment(*j)->getEnd()->getIndex();
169 if (currentTargetNode == otherTargetNode)
171 //cerr << "Routes will cross at " << currentTargetNode << endl;
172 return currentTargetNode;
181 bool FGTrafficRecord::isOpposing (FGGroundNetwork *net, FGTrafficRecord &other, int node)
183 // Check if current segment is the reverse segment for the other aircraft
185 //cerr << "Current segment " << currentPos << endl;
186 if ((currentPos > 0) && (other.currentPos > 0))
188 opp = net->findSegment(currentPos)->opposite();
190 if (opp->getIndex() == other.currentPos)
194 for (intVecIterator i = intentions.begin(); i != intentions.end(); i++)
196 if (other.intentions.size())
198 for (intVecIterator j = other.intentions.begin(); j != other.intentions.end(); j++)
200 // cerr << "Current segment 1 " << (*i) << endl;
202 if (opp = net->findSegment(*i)->opposite())
204 if (opp->getIndex() ==
205 net->findSegment(*j)->getIndex())
207 cerr << "Nodes " << net->findSegment(*i)->getIndex()
208 << " and " << net->findSegment(*j)->getIndex()
209 << " are opposites " << endl;
210 if (net->findSegment(*i)->getStart()->getIndex() == node) {
212 cerr << "Found the node" << endl;
226 void FGTrafficRecord::setSpeedAdjustment(double spd)
228 instruction.setChangeSpeed(true);
229 instruction.setSpeed(spd);
232 void FGTrafficRecord::setHeadingAdjustment(double heading)
234 instruction.setChangeHeading(true);
235 instruction.setHeading(heading);
240 /***************************************************************************
243 **************************************************************************/
244 FGATCInstruction::FGATCInstruction()
247 holdPosition = false;
249 changeHeading = false;
250 changeAltitude = false;
257 bool FGATCInstruction::hasInstruction()
259 return (holdPattern || holdPosition || changeSpeed || changeHeading || changeAltitude);
264 /***************************************************************************
265 * class FGTowerController
267 **************************************************************************/
268 FGTowerController::FGTowerController() :
274 void FGTowerController::announcePosition(int id, FGAIFlightPlan *intendedRoute, int currentPosition,
275 double lat, double lon, double heading,
276 double speed, double alt, double radius, int leg)
278 TrafficVectorIterator i = activeTraffic.begin();
279 // Search whether the current id alread has an entry
280 // This might be faster using a map instead of a vector, but let's start by taking a safe route
281 if (activeTraffic.size()) {
282 //while ((i->getId() != id) && i != activeTraffic.end()) {
283 while (i != activeTraffic.end()) {
284 if (i->getId() == id) {
291 // Add a new TrafficRecord if no one exsists for this aircraft.
292 if (i == activeTraffic.end() || (activeTraffic.size() == 0)) {
295 rec.setPositionAndHeading(lat, lon, heading, speed, alt);
296 rec.setRunway(intendedRoute->getRunway());
298 activeTraffic.push_back(rec);
300 i->setPositionAndHeading(lat, lon, heading, speed, alt);
304 void FGTowerController::update(int id, double lat, double lon, double heading, double speed, double alt,
307 TrafficVectorIterator i = activeTraffic.begin();
308 // Search search if the current id has an entry
309 // This might be faster using a map instead of a vector, but let's start by taking a safe route
310 TrafficVectorIterator current, closest;
311 if (activeTraffic.size()) {
312 //while ((i->getId() != id) && i != activeTraffic.end()) {
313 while (i != activeTraffic.end()) {
314 if (i->getId() == id) {
321 // // update position of the current aircraft
322 if (i == activeTraffic.end() || (activeTraffic.size() == 0)) {
323 SG_LOG(SG_GENERAL, SG_ALERT, "AI error: updating aircraft without traffic record");
325 i->setPositionAndHeading(lat, lon, heading, speed, alt);
330 // // see if we already have a clearance record for the currently active runway
331 ActiveRunwayVecIterator rwy = activeRunways.begin();
332 // again, a map might be more efficient here
333 if (activeRunways.size()) {
334 //while ((rwy->getRunwayName() != current->getRunway()) && (rwy != activeRunways.end())) {
335 while (rwy != activeRunways.end()) {
336 if (rwy->getRunwayName() == current->getRunway()) {
342 if (rwy == activeRunways.end()) {
343 ActiveRunway aRwy(current->getRunway(), id);
344 activeRunways.push_back(aRwy); // Since there are no clearance records for this runway yet
345 current->setHoldPosition(false); // Clear the current aircraft to continue
348 // Okay, we have a clearance record for this runway, so check
349 // whether the clearence ID matches that of the current aircraft
350 if (id == rwy->getCleared()) {
351 current->setHoldPosition(false);
353 current->setHoldPosition(true);
359 void FGTowerController::signOff(int id)
361 TrafficVectorIterator i = activeTraffic.begin();
362 // Search search if the current id alread has an entry
363 // This might be faster using a map instead of a vector, but let's start by taking a safe route
364 if (activeTraffic.size()) {
365 //while ((i->getId() != id) && i != activeTraffic.end()) {
366 while (i != activeTraffic.end()) {
367 if (i->getId() == id) {
373 // If this aircraft has left the runway, we can clear the departure record for this runway
374 ActiveRunwayVecIterator rwy = activeRunways.begin();
375 if (activeRunways.size()) {
376 //while ((rwy->getRunwayName() != i->getRunway()) && (rwy != activeRunways.end())) {
377 while (rwy != activeRunways.end()) {
378 if (rwy->getRunwayName() == i->getRunway()) {
383 if (rwy != activeRunways.end()) {
384 rwy = activeRunways.erase(rwy);
386 SG_LOG(SG_GENERAL, SG_ALERT, "AI error: Attempting to erase non-existing runway clearance record in FGTowerController::signoff");
389 if (i == activeTraffic.end() || (activeTraffic.size() == 0)) {
390 SG_LOG(SG_GENERAL, SG_ALERT, "AI error: Aircraft without traffic record is signing off from tower");
392 i = activeTraffic.erase(i);
397 // IF WE MAKE TRAFFICRECORD A MEMBER OF THE BASE CLASS
398 // THE FOLLOWING THREE FUNCTIONS: SIGNOFF, HAS INSTRUCTION AND GETINSTRUCTION CAN
399 // BECOME DEVIRTUALIZED AND BE A MEMBER OF THE BASE ATCCONTROLLER CLASS
400 // WHICH WOULD SIMPLIFY CODE MAINTENANCE.
401 // Note that this function is probably obsolete
402 bool FGTowerController::hasInstruction(int id)
404 TrafficVectorIterator i = activeTraffic.begin();
405 // Search search if the current id has an entry
406 // This might be faster using a map instead of a vector, but let's start by taking a safe route
407 if (activeTraffic.size())
409 //while ((i->getId() != id) && i != activeTraffic.end()) {
410 while (i != activeTraffic.end()) {
411 if (i->getId() == id) {
417 if (i == activeTraffic.end() || (activeTraffic.size() == 0)) {
418 SG_LOG(SG_GENERAL, SG_ALERT, "AI error: checking ATC instruction for aircraft without traffic record");
420 return i->hasInstruction();
426 FGATCInstruction FGTowerController::getInstruction(int id)
428 TrafficVectorIterator i = activeTraffic.begin();
429 // Search search if the current id has an entry
430 // This might be faster using a map instead of a vector, but let's start by taking a safe route
431 if (activeTraffic.size()) {
432 //while ((i->getId() != id) && i != activeTraffic.end()) {
433 while (i != activeTraffic.end()) {
434 if (i->getId() == id) {
440 if (i == activeTraffic.end() || (activeTraffic.size() == 0)) {
441 SG_LOG(SG_GENERAL, SG_ALERT, "AI error: requesting ATC instruction for aircraft without traffic record");
443 return i->getInstruction();
445 return FGATCInstruction();