OcTreeStamped.cpp
Go to the documentation of this file.
1 /*
2  * OctoMap - An Efficient Probabilistic 3D Mapping Framework Based on Octrees
3  * http://octomap.github.com/
4  *
5  * Copyright (c) 2009-2013, K.M. Wurm and A. Hornung, University of Freiburg
6  * All rights reserved.
7  * License: New BSD
8  *
9  * Redistribution and use in source and binary forms, with or without
10  * modification, are permitted provided that the following conditions are met:
11  *
12  * * Redistributions of source code must retain the above copyright
13  * notice, this list of conditions and the following disclaimer.
14  * * Redistributions in binary form must reproduce the above copyright
15  * notice, this list of conditions and the following disclaimer in the
16  * documentation and/or other materials provided with the distribution.
17  * * Neither the name of the University of Freiburg nor the names of its
18  * contributors may be used to endorse or promote products derived from
19  * this software without specific prior written permission.
20  *
21  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
22  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
25  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
26  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
27  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
28  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
29  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
30  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
31  * POSSIBILITY OF SUCH DAMAGE.
32  */
33 
34 #include "octomap/OcTreeStamped.h"
35 
36 namespace octomap {
37 
38  OcTreeStamped::OcTreeStamped(double resolution)
39  : OccupancyOcTreeBase<OcTreeNodeStamped>(resolution) {
41  }
42 
44  // this value is updated whenever inner nodes are
45  // updated using updateOccupancyChildren()
46  return root->getTimestamp();
47  }
48 
49  void OcTreeStamped::degradeOutdatedNodes(unsigned int time_thres) {
50  unsigned int query_time = (unsigned int) time(NULL);
51 
52  for(leaf_iterator it = this->begin_leafs(), end=this->end_leafs();
53  it!= end; ++it) {
54  if ( this->isNodeOccupied(*it)
55  && ((query_time - it->getTimestamp()) > time_thres) ) {
56  integrateMissNoTime(&*it);
57  }
58  }
59  }
60 
61  void OcTreeStamped::updateNodeLogOdds(OcTreeNodeStamped* node, const float& update) const {
63  node->updateTimestamp();
64  }
65 
68  }
69 
71 
72 } // end namespace
73 
void integrateMissNoTime(OcTreeNodeStamped *node) const
virtual void updateNodeLogOdds(OcTreeNodeStamped *node, const float &update) const
update logodds value of node by adding to the current value.
static StaticMemberInitializer ocTreeStampedMemberInit
to ensure static initialization (only once)
unsigned int getLastUpdateTime()
leaf_iterator begin_leafs(unsigned char maxDepth=0) const
OcTreeStamped(double resolution)
Default constructor, sets resolution of leafs.
virtual void updateNodeLogOdds(NODE *occupancyNode, const float &update) const
update logodds value of node by adding to the current value.
void degradeOutdatedNodes(unsigned int time_thres)
OcTreeNodeStamped * root
Pointer to the root NODE, NULL for empty tree.
unsigned int getTimestamp() const
Definition: OcTreeStamped.h:62
bool isNodeOccupied(const OcTreeNode *occupancyNode) const
queries whether a node is occupied according to the tree&#39;s parameter for "occupancy" ...


octomap
Author(s): Kai M. Wurm , Armin Hornung
autogenerated on Mon Feb 28 2022 22:58:06