/* Copyright (C) 2017 * swift project Community / Contributors * * This file is part of swift project. It is subject to the license terms in the LICENSE file found in the top-level * directory of this distribution and at http://www.swift-project.org/license.html. No part of swift project, * including this file, may be copied, modified, propagated, or distributed except according to the terms * contained in the LICENSE file. */ #include "blackmisc/simulation/interpolatorspline.h" #include "blackmisc/logmessage.h" #include "blackmisc/verify.h" using namespace BlackMisc::Aviation; using namespace BlackMisc::Geo; using namespace BlackMisc::Math; using namespace BlackMisc::PhysicalQuantities; using namespace BlackMisc::Simulation; namespace BlackMisc { namespace Simulation { namespace { //! \private https://en.wikipedia.org/wiki/Tridiagonal_matrix_algorithm template std::array solveTridiagonal(std::array, N> &matrix, std::array &d) { // *INDENT-OFF* const auto a = [&matrix](auto i) -> double& { return matrix[i][i-1]; }; // subdiagonal const auto b = [&matrix](auto i) -> double& { return matrix[i][i ]; }; // main diagonal const auto c = [&matrix](auto i) -> double& { return matrix[i][i+1]; }; // superdiagonal // forward sweep c(0) /= b(0); d[0] /= b(0); for (size_t i = 1; i < N; ++i) { const double denom = b(i) - a(i) * c(i - 1); if (i < N-1) { c(i) /= denom; } d[i] = (d[i] - a(i) * d[i - 1]) / denom; } // back substitution for (int i = N - 2; i >= 0; --i) { d[i] -= c(i) * d[i+1]; } return d; // *INDENT-ON* } //! \private Linear equation expressed as tridiagonal matrix. //! https://en.wikipedia.org/wiki/Spline_interpolation //! http://blog.ivank.net/interpolation-with-cubic-splines.html template std::array getDerivatives(const std::array &x, const std::array &y) { std::array, N> a {{}}; std::array b {{}}; // *INDENT-OFF* a[0][0] = 2.0 / (x[1] - x[0]); a[0][1] = 1.0 / (x[1] - x[0]); b[0] = 3.0 * (y[1] - y[0]) / ((x[1] - x[0]) * (x[1] - x[0])); a[N-1][N-2] = 1.0 / (x[N-1] - x[N-2]); a[N-1][N-1] = 2.0 / (x[N-1] - x[N-2]); b[N-1] = 3.0 * (y[N-1] - y[N-2]) / ((x[N-1] - x[N-2]) * (x[N-1] - x[N-2])); for (size_t i = 1; i < N - 1; ++i) { a[i][i-1] = 1.0 / (x[i] - x[i-1]); a[i][i ] = 2.0 / (x[i] - x[i-1]) + 2.0 / (x[i+1] - x[i]); a[i][i+1] = 1.0 / (x[i+1] - x[i]); b[i] = 3.0 * (y[i] - y[i-1]) / ((x[i] - x[i-1]) * (x[i] - x[i-1])) + 3.0 * (y[i+1] - y[i]) / ((x[i+1] - x[i]) * (x[i+1] - x[i])); } // *INDENT-ON* solveTridiagonal(a, b); return b; } //! \private Cubic interpolation. double evalSplineInterval(double x, double x0, double x1, double y0, double y1, double k0, double k1) { const double t = (x - x0) / (x1 - x0); const double a = k0 * (x1 - x0) - (y1 - y0); const double b = -k1 * (x1 - x0) + (y1 - y0); const double y = (1 - t) * y0 + t * y1 + t * (1 - t) * (a * (1 - t) + b * t); return y; } } CInterpolatorSpline::Interpolant CInterpolatorSpline::getInterpolant( qint64 currentTimeMsSinceEpoc, const CInterpolationAndRenderingSetupPerCallsign &setup, CInterpolationStatus &status, SituationLog &log) { Q_UNUSED(setup); // recalculate derivatives only if they changed if (currentTimeMsSinceEpoc > m_nextSampleAdjustedTime) { // with the latest updates of T243 the order and the offsets are supposed to be correct // so even mixing fast/slow updates shall work Q_ASSERT_X(m_aircraftSituations.isSortedAdjustedLatestFirst(), Q_FUNC_INFO, "Wrong sort order"); Q_ASSERT_X(m_aircraftSituations.size() <= IRemoteAircraftProvider::MaxSituationsPerCallsign, Q_FUNC_INFO, "Wrong size"); // Ref T243, KB 2018-02, can be removed in future, we verify situations above // Situations are supposed to be in correct order // const auto end = std::is_sorted_until(m_aircraftSituations.begin(), m_aircraftSituations.end(), [](auto && a, auto && b) { return b.getAdjustedMSecsSinceEpoch() < a.getAdjustedMSecsSinceEpoch(); }); // const auto validSituations = makeRange(m_aircraftSituations.begin(), end); // find the first situation earlier than the current time const CAircraftSituationList &validSituations = m_aircraftSituations; // if needed, we could also copy here const auto pivot = std::partition_point(validSituations.begin(), validSituations.end(), [ = ](auto &&s) { return s.getAdjustedMSecsSinceEpoch() > currentTimeMsSinceEpoc; }); const auto situationsNewer = makeRange(validSituations.begin(), pivot); const auto situationsOlder = makeRange(pivot, validSituations.end()); if (situationsNewer.isEmpty() || situationsOlder.size() < 2) { return m_interpolant; } m_s = std::array {{ *(situationsOlder.begin() + 1), *situationsOlder.begin(), *(situationsNewer.end() - 1) }}; // - altitude unit must be the same for all three, but the unit itself does not matter // - ground elevantion here normally is not available // - only use elevation plane here, do not call provider // - some info how has a plane moves: 100km/h => 1sec 27,7m => 5 secs 136m // - on an airport the plane does not move very fast, or not at all // - and the elevation remains (almost) constant for a wider area // - flying the ground elevation not really matters const CElevationPlane plane0 = this->findClosestElevationWithinRange(m_s[0], CElevationPlane::singlePointRadius()); const CElevationPlane plane1 = this->findClosestElevationWithinRange(m_s[1], CElevationPlane::singlePointRadius()); const CElevationPlane plane2 = this->findClosestElevationWithinRange(m_s[2], CElevationPlane::singlePointRadius()); // do not override existing values m_s[0].setGroundElevationChecked(plane0); m_s[1].setGroundElevationChecked(plane1); m_s[2].setGroundElevationChecked(plane2); const CLength cg = this->getCG(m_callsign); const double a0 = m_s[0].getCorrectedAltitude(cg).value(); const double a1 = m_s[1].getCorrectedAltitude(cg).value(); const double a2 = m_s[2].getCorrectedAltitude(cg).value(); const std::array, 3> normals {{ m_s[0].getPosition().normalVectorDouble(), m_s[1].getPosition().normalVectorDouble(), m_s[2].getPosition().normalVectorDouble() }}; PosArray pa; pa.x = {{ normals[0][0], normals[1][0], normals[2][0] }}; pa.y = {{ normals[0][1], normals[1][1], normals[2][1] }}; pa.z = {{ normals[0][2], normals[1][2], normals[2][2] }}; pa.a = {{ a0, a1, a2 }}; pa.t = {{ static_cast(m_s[0].getAdjustedMSecsSinceEpoch()), static_cast(m_s[1].getAdjustedMSecsSinceEpoch()), static_cast(m_s[2].getAdjustedMSecsSinceEpoch()) }}; pa.dx = getDerivatives(pa.t, pa.x); pa.dy = getDerivatives(pa.t, pa.y); pa.dz = getDerivatives(pa.t, pa.z); pa.da = getDerivatives(pa.t, pa.a); m_prevSampleAdjustedTime = situationsOlder.begin()->getAdjustedMSecsSinceEpoch(); m_nextSampleAdjustedTime = (situationsNewer.end() - 1)->getAdjustedMSecsSinceEpoch(); m_prevSampleTime = situationsOlder.begin()->getMSecsSinceEpoch(); m_nextSampleTime = (situationsNewer.end() - 1)->getMSecsSinceEpoch(); m_interpolant = Interpolant(pa, situationsOlder.begin()->getAltitude().getUnit(), { *situationsOlder.begin(), *(situationsNewer.end() - 1) }); } // Example: // prev.sample time 5 (received at 0) , next sample time 10 (received at 5) // cur.time 6: dt1=6-5=1, dt2=5 => fraction 1/5 // cur.time 9: dt1=9-5=4, dt2=5 => fraction 4/5 // // we use different offset times for interim pos. updates // prev.sample time 5 (received at 0) , 7/r:5, 10 (rec. at 5) // cur.time 6: dt1=6-5=1, dt2=7-5 => fraction 1/2 // cur.time 9: dt1=9-7=2, dt2=10-7=3 => fraction 2/3 // we use different offset times for fast pos. updates const double dt1 = static_cast(currentTimeMsSinceEpoc - m_prevSampleAdjustedTime); const double dt2 = static_cast(m_nextSampleAdjustedTime - m_prevSampleAdjustedTime); const double timeFraction = dt1 / dt2; // is that correct with dt2, or would it be // m_nextSampleTime - m_prevSampleTime // as long as the offset time is constant, it does not matter const qint64 interpolatedTime = m_prevSampleTime + timeFraction * dt2; // time fraction is expected between 0-1 status.setInterpolated(true); m_interpolant.setTimes(currentTimeMsSinceEpoc, timeFraction, interpolatedTime); if (this->hasAttachedLogger() && setup.logInterpolation()) { log.interpolationSituations.push_back(m_s[0]); log.interpolationSituations.push_back(m_s[1]); log.interpolationSituations.push_back(m_s[2]); // latest at end log.interpolator = 's'; log.deltaSampleTimesMs = dt2; log.simulationTimeFraction = timeFraction; log.noNetworkSituations = m_aircraftSituations.size(); log.tsInterpolated = interpolatedTime; // without offsets } return m_interpolant; } CCoordinateGeodetic CInterpolatorSpline::Interpolant::interpolatePosition(const CInterpolationAndRenderingSetupPerCallsign &setup) const { Q_UNUSED(setup); const double newX = evalSplineInterval(m_currentTimeMsSinceEpoc, m_pa.t[1], m_pa.t[2], m_pa.x[1], m_pa.x[2], m_pa.dx[1], m_pa.dx[2]); const double newY = evalSplineInterval(m_currentTimeMsSinceEpoc, m_pa.t[1], m_pa.t[2], m_pa.y[1], m_pa.y[2], m_pa.dy[1], m_pa.dy[2]); const double newZ = evalSplineInterval(m_currentTimeMsSinceEpoc, m_pa.t[1], m_pa.t[2], m_pa.z[1], m_pa.z[2], m_pa.dz[1], m_pa.dz[2]); CCoordinateGeodetic currentPosition; currentPosition.setNormalVector(newX, newY, newZ); return currentPosition; } CAltitude CInterpolatorSpline::Interpolant::interpolateAltitude(const CInterpolationAndRenderingSetupPerCallsign &setup) const { Q_UNUSED(setup); const double newA = evalSplineInterval(m_currentTimeMsSinceEpoc, m_pa.t[1], m_pa.t[2], m_pa.a[1], m_pa.a[2], m_pa.da[1], m_pa.da[2]); return CAltitude(newA, m_altitudeUnit); } void CInterpolatorSpline::Interpolant::setTimes(qint64 currentTimeMs, double timeFraction, qint64 interpolatedTimeMs) { m_currentTimeMsSinceEpoc = currentTimeMs; m_interpolatedTime = interpolatedTimeMs; m_pbh.setTimeFraction(timeFraction); } void CInterpolatorSpline::PosArray::initToZero() { for (int i = 0; i < 3; i++) { x[i] = 0; y[i] = 0; z[i] = 0; a[i] = 0; t[i] = 0; dx[i] = 0; dy[i] = 0; dz[i] = 0; da[i] = 0; } } const CInterpolatorSpline::PosArray &CInterpolatorSpline::PosArray::zeroPosArray() { static const PosArray pa = [] { PosArray p; p.initToZero(); return p; }(); return pa; } } // ns } // ns