mirror of
https://github.com/OpenSpace/OpenSpace.git
synced 2026-03-15 10:09:48 -05:00
191 lines
7.2 KiB
C++
191 lines
7.2 KiB
C++
/*****************************************************************************************
|
|
* *
|
|
* OpenSpace *
|
|
* *
|
|
* Copyright (c) 2014-2019 *
|
|
* *
|
|
* Permission is hereby granted, free of charge, to any person obtaining a copy of this *
|
|
* software and associated documentation files (the "Software"), to deal in the Software *
|
|
* without restriction, including without limitation the rights to use, copy, modify, *
|
|
* merge, publish, distribute, sublicense, and/or sell copies of the Software, and to *
|
|
* permit persons to whom the Software is furnished to do so, subject to the following *
|
|
* conditions: *
|
|
* *
|
|
* The above copyright notice and this permission notice shall be included in all copies *
|
|
* or substantial portions of the Software. *
|
|
* *
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, *
|
|
* INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A *
|
|
* PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT *
|
|
* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF *
|
|
* CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE *
|
|
* OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. *
|
|
****************************************************************************************/
|
|
|
|
#include <modules/autonavigation/pathsegment.h>
|
|
|
|
#include <modules/autonavigation/helperfunctions.h>
|
|
#include <modules/autonavigation/pathcurves.h>
|
|
#include <openspace/engine/globals.h>
|
|
#include <openspace/interaction/navigationhandler.h>
|
|
#include <openspace/util/camera.h>
|
|
#include <ghoul/logging/logmanager.h>
|
|
#include <ghoul/misc/easing.h>
|
|
|
|
namespace {
|
|
constexpr const char* _loggerCat = "PathSegment";
|
|
} // namespace
|
|
|
|
namespace openspace::autonavigation {
|
|
|
|
PathSegment::PathSegment(
|
|
Waypoint start, Waypoint end, CurveType type)
|
|
: _start(start), _end(end), _curveType(type)
|
|
{
|
|
initCurve();
|
|
|
|
// TODO: compute default duration based on curve length
|
|
// Also, when compensatng for simulation time later we need to make a guess for
|
|
// the duration, based on the current position of the target.
|
|
_duration = 5;
|
|
|
|
_speedFunction = SpeedFunction(_duration);
|
|
}
|
|
|
|
void PathSegment::setStart(Waypoint cs) {
|
|
_start = std::move(cs);
|
|
initCurve();
|
|
// TODO later: maybe recompute duration as well...
|
|
}
|
|
|
|
void PathSegment::setDuration(double d) {
|
|
_duration = d;
|
|
_speedFunction = SpeedFunction(_duration);
|
|
}
|
|
|
|
const Waypoint PathSegment::start() const { return _start; }
|
|
|
|
const Waypoint PathSegment::end() const { return _end; }
|
|
|
|
const double PathSegment::duration() const { return _duration; }
|
|
|
|
const double PathSegment::pathLength() const { return _curve->length(); }
|
|
|
|
// TODO: remove function for debugging
|
|
const std::vector<glm::dvec3> PathSegment::getControlPoints() const {
|
|
return _curve->getPoints();
|
|
}
|
|
|
|
CameraPose PathSegment::traversePath(double dt) {
|
|
// In case there is an error in the speed VS distance VS duration relation,
|
|
// make sure that we actually reach the end point.
|
|
double displacement;
|
|
if (_progressedTime > _duration && !hasReachedEnd()) {
|
|
// TODO: reach the target in a reasonable amount of time and with smooth motion
|
|
LWARNING("Did not reach the target in the given duration. Moving toward the target in constant speed. TODO: fix so that this does not happen"); // TODO: fix and then remove this
|
|
displacement = dt * speedAtTime(_duration - _duration * dt);
|
|
}
|
|
else {
|
|
displacement = dt * speedAtTime(_progressedTime);
|
|
}
|
|
|
|
_traveledDistance += displacement;
|
|
|
|
double relativeDisplacement = _traveledDistance / pathLength();
|
|
relativeDisplacement = std::max(0.0, std::min(relativeDisplacement, 1.0));
|
|
|
|
// TEST:
|
|
//LINFO("-----------------------------------");
|
|
//LINFO(fmt::format("u = {}", relativeDisplacement));
|
|
//LINFO(fmt::format("currentTime = {}", _currentTime));
|
|
|
|
_progressedTime += dt;
|
|
|
|
return interpolatedPose(relativeDisplacement);
|
|
}
|
|
|
|
std::string PathSegment::getCurrentAnchor() const {
|
|
bool pastHalfway = (_traveledDistance / pathLength()) > 0.5;
|
|
return (pastHalfway) ? _end.nodeDetails.identifier : _start.nodeDetails.identifier;
|
|
}
|
|
|
|
bool PathSegment::hasReachedEnd() const {
|
|
return (_traveledDistance / pathLength()) >= 1.0;
|
|
}
|
|
|
|
/*
|
|
* Get speed at time value in the range [0, duration]
|
|
* OBS! If integrated over the curve it must match the total length or the curve.
|
|
* Thus, we scale according to the constraint in eq. 14 in Eberly 2007
|
|
* (https://www.geometrictools.com/Documentation/MovingAlongCurveSpecifiedSpeed.pdf)
|
|
*/
|
|
double PathSegment::speedAtTime(double time) const {
|
|
ghoul_assert(time >= 0 && time <= _duration, "Time out of range [0, duration]");
|
|
double t = time / _duration;
|
|
return (pathLength() * _speedFunction.value(t)) / _speedFunction.integratedSum;
|
|
}
|
|
|
|
CameraPose PathSegment::interpolatedPose(double u) const {
|
|
CameraPose cs;
|
|
cs.position = _curve->positionAt(u);
|
|
cs.rotation = _curve->rotationAt(u);
|
|
return cs;
|
|
}
|
|
|
|
// Initialise the curve, based on the start, end state and curve type
|
|
void PathSegment::initCurve() {
|
|
_curve.reset();
|
|
|
|
switch (_curveType) {
|
|
case CurveType::Bezier3:
|
|
_curve = std::make_shared<Bezier3Curve>(_start, _end);
|
|
break;
|
|
case CurveType::Linear:
|
|
_curve = std::make_shared<LinearCurve>(_start, _end);
|
|
break;
|
|
case CurveType::Pause:
|
|
_curve = std::make_shared<PauseCurve>(_start);
|
|
break;
|
|
default:
|
|
LERROR("Could not create curve. Type does not exist!");
|
|
return;
|
|
}
|
|
}
|
|
|
|
PathSegment::SpeedFunction::SpeedFunction(double duration) {
|
|
// apply duration constraint (eq. 14 in Eberly)
|
|
const int steps = 100;
|
|
double dt = duration / steps;
|
|
// TODO: better approximation
|
|
double speedSum = 0.0;
|
|
for (double t = 0.0; t <= 1.0; t += 1.0 / steps) {
|
|
speedSum += dt * value(t);
|
|
}
|
|
|
|
integratedSum = speedSum;
|
|
}
|
|
|
|
double PathSegment::SpeedFunction::value(double t) const {
|
|
ghoul_assert(t >= 0 && t <= 1, "Variable t out of range [0,1]");
|
|
|
|
const double tPeak = 0.5;
|
|
double speed = 1.0;
|
|
|
|
// accelerate
|
|
if (t <= tPeak) {
|
|
double tScaled = t / tPeak;
|
|
speed = ghoul::cubicEaseInOut(tScaled);
|
|
}
|
|
// deaccelerate
|
|
else {
|
|
double tScaled = (t - tPeak) / (1.0 - tPeak);
|
|
speed = 1.0 - ghoul::cubicEaseInOut(tScaled);
|
|
}
|
|
|
|
// avoid zero speed
|
|
speed += 0.001;
|
|
return speed;
|
|
}
|
|
|
|
} // namespace openspace::autonavigation
|