2004-06-03 17:59:14 +00:00
|
|
|
/******************************************************************************
|
|
|
|
* Schedule.cxx
|
|
|
|
* Written by Durk Talsma, started May 5, 2004.
|
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or
|
|
|
|
* modify it under the terms of the GNU General Public License as
|
|
|
|
* published by the Free Software Foundation; either version 2 of the
|
|
|
|
* License, or (at your option) any later version.
|
|
|
|
*
|
|
|
|
* This program is distributed in the hope that it will be useful, but
|
|
|
|
* WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
|
|
* General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU General Public License
|
|
|
|
* along with this program; if not, write to the Free Software
|
2006-02-21 01:16:04 +00:00
|
|
|
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
|
2004-06-03 17:59:14 +00:00
|
|
|
*
|
|
|
|
*
|
|
|
|
****************************************************************************
|
|
|
|
*
|
|
|
|
*****************************************************************************/
|
2006-02-18 13:58:09 +00:00
|
|
|
|
|
|
|
#ifdef HAVE_CONFIG_H
|
|
|
|
# include "config.h"
|
|
|
|
#endif
|
|
|
|
|
2004-06-03 17:59:14 +00:00
|
|
|
#include <stdlib.h>
|
|
|
|
#include <time.h>
|
|
|
|
#include <iostream>
|
|
|
|
#include <fstream>
|
|
|
|
|
|
|
|
|
|
|
|
#include <string>
|
|
|
|
#include <vector>
|
2004-06-06 08:35:09 +00:00
|
|
|
#include <algorithm>
|
2004-06-03 17:59:14 +00:00
|
|
|
|
|
|
|
#include <plib/sg.h>
|
|
|
|
|
|
|
|
#include <simgear/compiler.h>
|
|
|
|
#include <simgear/math/polar3d.hxx>
|
|
|
|
#include <simgear/math/sg_geodesy.hxx>
|
|
|
|
#include <simgear/props/props.hxx>
|
|
|
|
#include <simgear/route/waypoint.hxx>
|
|
|
|
#include <simgear/structure/subsystem_mgr.hxx>
|
|
|
|
#include <simgear/xml/easyxml.hxx>
|
|
|
|
|
|
|
|
#include <AIModel/AIFlightPlan.hxx>
|
|
|
|
#include <AIModel/AIManager.hxx>
|
2006-02-11 13:16:56 +00:00
|
|
|
#include <AIModel/AIAircraft.hxx>
|
2004-06-03 17:59:14 +00:00
|
|
|
#include <Airports/simple.hxx>
|
|
|
|
#include <Main/fg_init.hxx> // That's pretty ugly, but I need fgFindAirportID
|
|
|
|
|
|
|
|
|
|
|
|
#include "SchedFlight.hxx"
|
|
|
|
#include "TrafficMgr.hxx"
|
|
|
|
|
2004-06-06 08:35:09 +00:00
|
|
|
SG_USING_STD( sort );
|
2004-06-03 17:59:14 +00:00
|
|
|
|
|
|
|
/******************************************************************************
|
|
|
|
* the FGAISchedule class contains data members and code to maintain a
|
|
|
|
* schedule of Flights for an articically controlled aircraft.
|
|
|
|
*****************************************************************************/
|
|
|
|
FGAISchedule::FGAISchedule()
|
|
|
|
{
|
|
|
|
firstRun = true;
|
|
|
|
AIManagerRef = 0;
|
2005-12-06 18:32:07 +00:00
|
|
|
|
|
|
|
heavy = false;
|
|
|
|
lat = 0;
|
|
|
|
lon = 0;
|
|
|
|
radius = 0;
|
|
|
|
groundOffset = 0;
|
|
|
|
distanceToUser = 0;
|
2004-06-03 17:59:14 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
FGAISchedule::FGAISchedule(string mdl,
|
|
|
|
string liv,
|
|
|
|
string reg,
|
|
|
|
bool hvy,
|
2005-02-10 09:01:51 +00:00
|
|
|
string act,
|
|
|
|
string arln,
|
|
|
|
string mclass,
|
|
|
|
string fltpe,
|
|
|
|
double rad,
|
|
|
|
double grnd,
|
2004-06-03 17:59:14 +00:00
|
|
|
FGScheduledFlightVec flt)
|
|
|
|
{
|
|
|
|
modelPath = mdl;
|
|
|
|
livery = liv;
|
|
|
|
registration = reg;
|
2005-02-10 09:01:51 +00:00
|
|
|
acType = act;
|
|
|
|
airline = arln;
|
|
|
|
m_class = mclass;
|
|
|
|
flightType = fltpe;
|
2005-12-06 18:32:07 +00:00
|
|
|
lat = 0;
|
|
|
|
lon = 0;
|
2005-02-10 09:01:51 +00:00
|
|
|
radius = rad;
|
|
|
|
groundOffset = grnd;
|
2005-12-06 18:32:07 +00:00
|
|
|
distanceToUser = 0;
|
2004-06-03 17:59:14 +00:00
|
|
|
heavy = hvy;
|
|
|
|
for (FGScheduledFlightVecIterator i = flt.begin();
|
|
|
|
i != flt.end();
|
|
|
|
i++)
|
|
|
|
flights.push_back(FGScheduledFlight((*i)));
|
|
|
|
AIManagerRef = 0;
|
|
|
|
firstRun = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
FGAISchedule::FGAISchedule(const FGAISchedule &other)
|
|
|
|
{
|
|
|
|
modelPath = other.modelPath;
|
|
|
|
livery = other.livery;
|
|
|
|
registration = other.registration;
|
|
|
|
heavy = other.heavy;
|
|
|
|
flights = other.flights;
|
|
|
|
lat = other.lat;
|
|
|
|
lon = other.lon;
|
|
|
|
AIManagerRef = other.AIManagerRef;
|
2005-02-10 09:01:51 +00:00
|
|
|
acType = other.acType;
|
|
|
|
airline = other.airline;
|
|
|
|
m_class = other.m_class;
|
2004-06-03 17:59:14 +00:00
|
|
|
firstRun = other.firstRun;
|
2005-02-10 09:01:51 +00:00
|
|
|
radius = other.radius;
|
|
|
|
groundOffset = other.groundOffset;
|
|
|
|
flightType = other.flightType;
|
|
|
|
distanceToUser = other.distanceToUser;
|
2004-06-03 17:59:14 +00:00
|
|
|
}
|
|
|
|
|
2005-02-10 09:01:51 +00:00
|
|
|
|
2004-06-03 17:59:14 +00:00
|
|
|
FGAISchedule::~FGAISchedule()
|
|
|
|
{
|
|
|
|
|
|
|
|
}
|
|
|
|
|
2005-02-10 09:01:51 +00:00
|
|
|
bool FGAISchedule::init()
|
|
|
|
{
|
|
|
|
//tm targetTimeDate;
|
|
|
|
//SGTime* currTimeDate = globals->get_time_params();
|
|
|
|
|
|
|
|
//tm *temp = currTimeDate->getGmt();
|
|
|
|
//char buffer[512];
|
|
|
|
//sgTimeFormatTime(&targetTimeDate, buffer);
|
|
|
|
//cout << "Scheduled Time " << buffer << endl;
|
|
|
|
//cout << "Time :" << time(NULL) << " SGTime : " << sgTimeGetGMT(temp) << endl;
|
|
|
|
for (FGScheduledFlightVecIterator i = flights.begin();
|
|
|
|
i != flights.end();
|
|
|
|
i++)
|
|
|
|
{
|
|
|
|
//i->adjustTime(now);
|
|
|
|
if (!(i->initializeAirports()))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
//sort(flights.begin(), flights.end());
|
|
|
|
// Since time isn't initialized yet when this function is called,
|
|
|
|
// Find the closest possible airport.
|
|
|
|
// This should give a reasonable initialization order.
|
|
|
|
setClosestDistanceToUser();
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool FGAISchedule::update(time_t now)
|
2004-06-03 17:59:14 +00:00
|
|
|
{
|
|
|
|
FGAirport *dep;
|
|
|
|
FGAirport *arr;
|
|
|
|
sgdVec3 a, b, cross;
|
|
|
|
sgdVec3 newPos;
|
|
|
|
sgdMat4 matrix;
|
|
|
|
double angle;
|
|
|
|
|
|
|
|
FGAIManager *aimgr;
|
|
|
|
string airport;
|
|
|
|
|
|
|
|
double courseToUser, courseToDest;
|
2005-02-10 09:01:51 +00:00
|
|
|
double distanceToDest;
|
2004-06-03 17:59:14 +00:00
|
|
|
double speed;
|
|
|
|
|
|
|
|
Point3D temp;
|
|
|
|
time_t
|
|
|
|
totalTimeEnroute,
|
|
|
|
elapsedTimeEnroute,
|
|
|
|
remainingTimeEnroute;
|
|
|
|
double
|
|
|
|
userLatitude,
|
|
|
|
userLongitude;
|
|
|
|
|
2004-07-22 18:50:29 +00:00
|
|
|
if (fgGetBool("/sim/traffic-manager/enabled") == false)
|
2005-02-10 09:01:51 +00:00
|
|
|
return true;
|
2004-06-03 17:59:14 +00:00
|
|
|
|
|
|
|
aimgr = (FGAIManager *) globals-> get_subsystem("ai_model");
|
|
|
|
// Before the flight status of this traffic entity is updated
|
|
|
|
// for the first time, we need to roll back it's flight schedule so
|
|
|
|
// so that all the flights are centered around this simulated week's time
|
|
|
|
// table. This is to avoid the situation where the first scheduled flight is
|
|
|
|
// in the future, causing the traffic manager to not generate traffic until
|
|
|
|
// simulated time has caught up with the real world time at initialization.
|
|
|
|
// This is to counter a more general initialization bug, caused by the fact
|
|
|
|
// that warp is not yet set when the schedule is initialized. This is
|
|
|
|
// especially a problem when using a negative time offset.
|
|
|
|
// i.e let's say we specify FlightGear to run with --time-offset=-24:00:00.
|
|
|
|
// Then the schedule will initialize using today, but we will fly yesterday.
|
|
|
|
// Thus, it would take a whole day of simulation before the traffic manager
|
|
|
|
// finally kicks in.
|
|
|
|
if (firstRun)
|
|
|
|
{
|
|
|
|
for (FGScheduledFlightVecIterator i = flights.begin();
|
2005-02-10 09:01:51 +00:00
|
|
|
i != flights.end();
|
|
|
|
i++)
|
|
|
|
{
|
|
|
|
i->adjustTime(now);
|
|
|
|
}
|
2004-06-03 17:59:14 +00:00
|
|
|
firstRun = false;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Sort all the scheduled flights according to scheduled departure time.
|
|
|
|
// Because this is done at every update, we only need to check the status
|
|
|
|
// of the first listed flight.
|
|
|
|
sort(flights.begin(), flights.end());
|
|
|
|
FGScheduledFlightVecIterator i = flights.begin();
|
2004-11-29 09:41:43 +00:00
|
|
|
if (AIManagerRef)
|
|
|
|
{
|
|
|
|
// Check if this aircraft has been released.
|
|
|
|
FGTrafficManager *tmgr = (FGTrafficManager *) globals->get_subsystem("Traffic Manager");
|
|
|
|
if (tmgr->isReleased(AIManagerRef))
|
|
|
|
AIManagerRef = 0;
|
|
|
|
}
|
|
|
|
|
2004-06-03 17:59:14 +00:00
|
|
|
if (!AIManagerRef)
|
|
|
|
{
|
|
|
|
userLatitude = fgGetDouble("/position/latitude-deg");
|
|
|
|
userLongitude = fgGetDouble("/position/longitude-deg");
|
|
|
|
|
2005-02-10 09:01:51 +00:00
|
|
|
//cerr << "Estimated minimum distance to user: " << distanceToUser << endl;
|
2004-06-03 17:59:14 +00:00
|
|
|
// This flight entry is entirely in the past, do we need to
|
|
|
|
// push it forward in time to the next scheduled departure.
|
|
|
|
if ((i->getDepartureTime() < now) && (i->getArrivalTime() < now))
|
|
|
|
{
|
|
|
|
i->update();
|
2005-02-10 09:01:51 +00:00
|
|
|
return true;
|
2004-06-03 17:59:14 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// Departure time in the past and arrival time in the future.
|
|
|
|
// This flight is in progress, so we need to calculate it's
|
|
|
|
// approximate position and -if in range- create an AIAircraft
|
|
|
|
// object for it.
|
2004-11-29 09:41:43 +00:00
|
|
|
//if ((i->getDepartureTime() < now) && (i->getArrivalTime() > now))
|
|
|
|
|
|
|
|
|
|
|
|
// Part of this flight is in the future.
|
|
|
|
if (i->getArrivalTime() > now)
|
2004-06-03 17:59:14 +00:00
|
|
|
{
|
|
|
|
dep = i->getDepartureAirport();
|
|
|
|
arr = i->getArrivalAirport ();
|
2005-02-10 09:01:51 +00:00
|
|
|
if (!(dep && arr))
|
|
|
|
return false;
|
2004-06-03 17:59:14 +00:00
|
|
|
|
2005-02-10 09:01:51 +00:00
|
|
|
temp = sgPolarToCart3d(Point3D(dep->getLongitude() *
|
2004-06-03 17:59:14 +00:00
|
|
|
SG_DEGREES_TO_RADIANS,
|
2005-02-10 09:01:51 +00:00
|
|
|
dep->getLatitude() *
|
2004-06-03 17:59:14 +00:00
|
|
|
SG_DEGREES_TO_RADIANS,
|
|
|
|
1.0));
|
|
|
|
a[0] = temp.x();
|
|
|
|
a[1] = temp.y();
|
|
|
|
a[2] = temp.z();
|
|
|
|
|
2005-02-10 09:01:51 +00:00
|
|
|
temp = sgPolarToCart3d(Point3D(arr->getLongitude() *
|
2004-06-03 17:59:14 +00:00
|
|
|
SG_DEGREES_TO_RADIANS,
|
2005-02-10 09:01:51 +00:00
|
|
|
arr->getLatitude() *
|
2004-06-03 17:59:14 +00:00
|
|
|
SG_DEGREES_TO_RADIANS,
|
|
|
|
1.0));
|
|
|
|
b[0] = temp.x();
|
|
|
|
b[1] = temp.y();
|
|
|
|
b[2] = temp.z();
|
|
|
|
sgdNormaliseVec3(a);
|
|
|
|
sgdNormaliseVec3(b);
|
|
|
|
sgdVectorProductVec3(cross,b,a);
|
|
|
|
|
|
|
|
angle = sgACos(sgdScalarProductVec3(a,b));
|
|
|
|
|
|
|
|
// Okay, at this point we have the angle between departure and
|
|
|
|
// arrival airport, in degrees. From here we can interpolate the
|
|
|
|
// position of the aircraft by calculating the ratio between
|
|
|
|
// total time enroute and elapsed time enroute.
|
2004-11-29 09:41:43 +00:00
|
|
|
|
2004-06-03 17:59:14 +00:00
|
|
|
totalTimeEnroute = i->getArrivalTime() - i->getDepartureTime();
|
2005-02-10 09:01:51 +00:00
|
|
|
if (now > i->getDepartureTime())
|
|
|
|
{
|
|
|
|
//err << "Lat = " << lat << ", lon = " << lon << endl;
|
|
|
|
//cerr << "Time diff: " << now-i->getDepartureTime() << endl;
|
|
|
|
elapsedTimeEnroute = now - i->getDepartureTime();
|
|
|
|
remainingTimeEnroute = i->getArrivalTime() - now;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
lat = dep->getLatitude();
|
|
|
|
lon = dep->getLongitude();
|
|
|
|
elapsedTimeEnroute = 0;
|
|
|
|
remainingTimeEnroute = totalTimeEnroute;
|
|
|
|
}
|
|
|
|
|
2004-06-03 17:59:14 +00:00
|
|
|
angle *= ( (double) elapsedTimeEnroute/ (double) totalTimeEnroute);
|
|
|
|
|
|
|
|
|
|
|
|
//cout << "a = " << a[0] << " " << a[1] << " " << a[2]
|
|
|
|
// << "b = " << b[0] << " " << b[1] << " " << b[2] << endl;
|
|
|
|
sgdMakeRotMat4(matrix, angle, cross);
|
|
|
|
for(int j = 0; j < 3; j++)
|
|
|
|
{
|
|
|
|
newPos[j] =0.0;
|
|
|
|
for (int k = 0; k<3; k++)
|
|
|
|
{
|
|
|
|
newPos[j] += matrix[j][k]*a[k];
|
|
|
|
}
|
|
|
|
}
|
2005-02-10 09:01:51 +00:00
|
|
|
|
2004-06-03 17:59:14 +00:00
|
|
|
temp = sgCartToPolar3d(Point3D(newPos[0], newPos[1],newPos[2]));
|
2004-11-29 09:41:43 +00:00
|
|
|
if (now > i->getDepartureTime())
|
|
|
|
{
|
|
|
|
//cerr << "Lat = " << lat << ", lon = " << lon << endl;
|
|
|
|
//cerr << "Time diff: " << now-i->getDepartureTime() << endl;
|
|
|
|
lat = temp.lat() * SG_RADIANS_TO_DEGREES;
|
|
|
|
lon = temp.lon() * SG_RADIANS_TO_DEGREES;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2005-02-10 09:01:51 +00:00
|
|
|
lat = dep->getLatitude();
|
|
|
|
lon = dep->getLongitude();
|
2004-11-29 09:41:43 +00:00
|
|
|
}
|
2004-06-03 17:59:14 +00:00
|
|
|
|
2005-02-10 09:01:51 +00:00
|
|
|
|
2004-06-03 17:59:14 +00:00
|
|
|
SGWayPoint current (lon,
|
|
|
|
lat,
|
|
|
|
i->getCruiseAlt());
|
|
|
|
SGWayPoint user ( userLongitude,
|
|
|
|
userLatitude,
|
|
|
|
i->getCruiseAlt());
|
2005-02-10 09:01:51 +00:00
|
|
|
SGWayPoint dest ( arr->getLongitude(),
|
|
|
|
arr->getLatitude(),
|
2004-06-03 17:59:14 +00:00
|
|
|
i->getCruiseAlt());
|
|
|
|
// We really only need distance to user
|
|
|
|
// and course to destination
|
2004-11-29 09:41:43 +00:00
|
|
|
user.CourseAndDistance(current, &courseToUser, &distanceToUser);
|
|
|
|
dest.CourseAndDistance(current, &courseToDest, &distanceToDest);
|
2004-06-03 17:59:14 +00:00
|
|
|
speed = (distanceToDest*SG_METER_TO_NM) /
|
|
|
|
((double) remainingTimeEnroute/3600.0);
|
|
|
|
|
|
|
|
|
|
|
|
// If distance between user and simulated aircaft is less
|
|
|
|
// then 500nm, create this flight. At jet speeds 500 nm is roughly
|
|
|
|
// one hour flight time, so that would be a good approximate point
|
|
|
|
// to start a more detailed simulation of this aircraft.
|
|
|
|
//cerr << registration << " is currently enroute from "
|
2004-12-22 23:57:07 +00:00
|
|
|
// << dep->_id << " to " << arr->_id << "distance : "
|
2004-07-22 18:50:29 +00:00
|
|
|
// << distanceToUser*SG_METER_TO_NM << endl;
|
2005-02-10 09:01:51 +00:00
|
|
|
if ((distanceToUser*SG_METER_TO_NM) < TRAFFICTOAIDIST)
|
2004-06-03 17:59:14 +00:00
|
|
|
{
|
2005-02-10 09:01:51 +00:00
|
|
|
string flightPlanName = dep->getId() + string("-") + arr->getId() +
|
2004-07-22 18:50:29 +00:00
|
|
|
string(".xml");
|
2004-11-29 09:41:43 +00:00
|
|
|
int alt;
|
|
|
|
//if ((i->getDepartureTime() < now))
|
|
|
|
//{
|
|
|
|
// alt = i->getCruiseAlt() *100;
|
|
|
|
// }
|
|
|
|
//else
|
|
|
|
//{
|
2004-12-22 23:57:07 +00:00
|
|
|
// alt = dep->_elevation+19;
|
2004-11-29 09:41:43 +00:00
|
|
|
// }
|
2004-06-03 17:59:14 +00:00
|
|
|
|
2006-03-11 18:14:48 +00:00
|
|
|
// Only allow traffic to be created when the model path exists
|
|
|
|
SGPath mp(globals->get_fg_root());
|
|
|
|
mp.append(modelPath);
|
|
|
|
if (mp.exists())
|
|
|
|
{
|
|
|
|
FGAIAircraft *aircraft = new FGAIAircraft(this);
|
|
|
|
aircraft->setPerformance(m_class); //"jet_transport";
|
|
|
|
aircraft->setCompany(airline); //i->getAirline();
|
|
|
|
aircraft->setAcType(acType); //i->getAcType();
|
|
|
|
aircraft->setPath(modelPath.c_str());
|
2006-03-29 18:36:21 +00:00
|
|
|
//aircraft->setFlightPlan(flightPlanName);
|
2006-03-11 18:14:48 +00:00
|
|
|
aircraft->setLatitude(lat);
|
|
|
|
aircraft->setLongitude(lon);
|
|
|
|
aircraft->setAltitude(i->getCruiseAlt()*100); // convert from FL to feet
|
|
|
|
aircraft->setSpeed(speed);
|
|
|
|
aircraft->setBank(0);
|
2006-03-29 18:36:21 +00:00
|
|
|
aircraft->SetFlightPlan(new FGAIFlightPlan(flightPlanName, courseToDest, i->getDepartureTime(), dep,
|
2006-03-11 18:14:48 +00:00
|
|
|
arr,true, radius, i->getCruiseAlt()*100, lat, lon, speed, flightType, acType, airline));
|
|
|
|
aimgr->attach(aircraft);
|
|
|
|
|
|
|
|
|
|
|
|
AIManagerRef = aircraft->getID();
|
|
|
|
//cerr << "Class: " << m_class << ". acType: " << acType << ". Airline: " << airline << ". Speed = " << speed << ". From " << dep->getId() << " to " << arr->getId() << ". Time Fraction = " << (remainingTimeEnroute/(double) totalTimeEnroute) << endl;
|
|
|
|
//cerr << "Latitude : " << lat << ". Longitude : " << lon << endl;
|
|
|
|
//cerr << "Dep : " << dep->getLatitude()<< ", "<< dep->getLongitude() << endl;
|
|
|
|
//cerr << "Arr : " << arr->getLatitude()<< ", "<< arr->getLongitude() << endl;
|
|
|
|
//cerr << "Time remaining = " << (remainingTimeEnroute/3600.0) << endl;
|
|
|
|
//cerr << "Total time = " << (totalTimeEnroute/3600.0) << endl;
|
|
|
|
//cerr << "Distance remaining = " << distanceToDest*SG_METER_TO_NM << endl;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
SG_LOG(SG_INPUT, SG_WARN, "TrafficManager: Could not load model " << mp.str());
|
|
|
|
}
|
2004-06-03 17:59:14 +00:00
|
|
|
}
|
2005-02-10 09:01:51 +00:00
|
|
|
return true;
|
|
|
|
}
|
2004-07-22 18:50:29 +00:00
|
|
|
|
2004-06-03 17:59:14 +00:00
|
|
|
// Both departure and arrival time are in the future, so this
|
|
|
|
// the aircraft is parked at the departure airport.
|
2004-11-29 09:41:43 +00:00
|
|
|
// Currently this status is mostly ignored, but in future
|
2004-06-03 17:59:14 +00:00
|
|
|
// versions, code should go here that -if within user range-
|
|
|
|
// positions these aircraft at parking locations at the airport.
|
2005-02-10 09:01:51 +00:00
|
|
|
if ((i->getDepartureTime() > now) && (i->getArrivalTime() > now))
|
2004-06-03 17:59:14 +00:00
|
|
|
{
|
|
|
|
dep = i->getDepartureAirport();
|
2005-02-10 09:01:51 +00:00
|
|
|
return true;
|
2004-06-03 17:59:14 +00:00
|
|
|
}
|
|
|
|
}
|
2005-10-18 18:44:37 +00:00
|
|
|
//cerr << "Traffic schedule got to beyond last clause" << endl;
|
2005-04-19 12:52:26 +00:00
|
|
|
// EMH: prevent a warning, should this be 'true' instead?
|
2005-10-18 18:44:37 +00:00
|
|
|
// DT: YES. Originally, this code couldn't be reached, but
|
|
|
|
// when the "if(!(AIManagerManager))" clause is false we
|
|
|
|
// fall through right to the end. This is a valid flow.
|
|
|
|
// the actual value is pretty innocent, only it triggers
|
|
|
|
// warning in TrafficManager::update().
|
|
|
|
// (which was added as a sanity check for myself in the first place. :-)
|
|
|
|
return true;
|
2004-06-03 17:59:14 +00:00
|
|
|
}
|
2004-11-29 09:41:43 +00:00
|
|
|
|
|
|
|
|
|
|
|
void FGAISchedule::next()
|
|
|
|
{
|
|
|
|
flights.begin()->update();
|
|
|
|
sort(flights.begin(), flights.end());
|
|
|
|
}
|
|
|
|
|
2005-02-10 09:01:51 +00:00
|
|
|
double FGAISchedule::getSpeed()
|
|
|
|
{
|
|
|
|
double courseToUser, courseToDest;
|
|
|
|
double distanceToUser, distanceToDest;
|
|
|
|
double speed, remainingTimeEnroute;
|
|
|
|
FGAirport *dep, *arr;
|
|
|
|
|
|
|
|
FGScheduledFlightVecIterator i = flights.begin();
|
|
|
|
dep = i->getDepartureAirport();
|
|
|
|
arr = i->getArrivalAirport ();
|
|
|
|
if (!(dep && arr))
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
SGWayPoint dest ( dep->getLongitude(),
|
|
|
|
dep->getLatitude(),
|
|
|
|
i->getCruiseAlt());
|
|
|
|
SGWayPoint curr ( arr->getLongitude(),
|
|
|
|
arr->getLatitude(),
|
|
|
|
i->getCruiseAlt());
|
|
|
|
remainingTimeEnroute = i->getArrivalTime() - i->getDepartureTime();
|
|
|
|
dest.CourseAndDistance(curr, &courseToDest, &distanceToDest);
|
|
|
|
speed = (distanceToDest*SG_METER_TO_NM) /
|
|
|
|
((double) remainingTimeEnroute/3600.0);
|
|
|
|
return speed;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void FGAISchedule::setClosestDistanceToUser()
|
|
|
|
{
|
|
|
|
|
|
|
|
|
|
|
|
double course;
|
|
|
|
double dist;
|
|
|
|
|
|
|
|
Point3D temp;
|
|
|
|
time_t
|
|
|
|
totalTimeEnroute,
|
|
|
|
elapsedTimeEnroute;
|
|
|
|
|
|
|
|
double userLatitude = fgGetDouble("/position/latitude-deg");
|
|
|
|
double userLongitude = fgGetDouble("/position/longitude-deg");
|
|
|
|
|
|
|
|
FGAirport *dep;
|
|
|
|
|
2005-09-11 09:53:55 +00:00
|
|
|
#if defined( __CYGWIN__) || defined( __MINGW32__)
|
2005-02-18 12:40:38 +00:00
|
|
|
#define HUGE HUGE_VAL
|
|
|
|
#endif
|
2005-02-10 09:01:51 +00:00
|
|
|
distanceToUser = HUGE;
|
|
|
|
FGScheduledFlightVecIterator i = flights.begin();
|
|
|
|
while (i != flights.end())
|
|
|
|
{
|
|
|
|
dep = i->getDepartureAirport();
|
|
|
|
//if (!(dep))
|
|
|
|
//return HUGE;
|
|
|
|
|
|
|
|
SGWayPoint user ( userLongitude,
|
|
|
|
userLatitude,
|
|
|
|
i->getCruiseAlt());
|
|
|
|
SGWayPoint current (dep->getLongitude(),
|
|
|
|
dep->getLatitude(),
|
|
|
|
0);
|
|
|
|
user.CourseAndDistance(current, &course, &dist);
|
|
|
|
if (dist < distanceToUser)
|
|
|
|
{
|
|
|
|
distanceToUser = dist;
|
|
|
|
//cerr << "Found closest distance to user for " << registration << " to be " << distanceToUser << " at airport " << dep->getId() << endl;
|
|
|
|
}
|
|
|
|
i++;
|
|
|
|
}
|
|
|
|
//return distToUser;
|
|
|
|
}
|