All Classes Namespaces Functions Variables Typedefs Enumerations Enumerator
GoalStates.cpp
00001 /*********************************************************************
00002 * Software License Agreement (BSD License)
00003 *
00004 *  Copyright (c) 2010, Rice University
00005 *  All rights reserved.
00006 *
00007 *  Redistribution and use in source and binary forms, with or without
00008 *  modification, are permitted provided that the following conditions
00009 *  are met:
00010 *
00011 *   * Redistributions of source code must retain the above copyright
00012 *     notice, this list of conditions and the following disclaimer.
00013 *   * Redistributions in binary form must reproduce the above
00014 *     copyright notice, this list of conditions and the following
00015 *     disclaimer in the documentation and/or other materials provided
00016 *     with the distribution.
00017 *   * Neither the name of the Rice University nor the names of its
00018 *     contributors may be used to endorse or promote products derived
00019 *     from this software without specific prior written permission.
00020 *
00021 *  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
00022 *  "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
00023 *  LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
00024 *  FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
00025 *  COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
00026 *  INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
00027 *  BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
00028 *  LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
00029 *  CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
00030 *  LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
00031 *  ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
00032 *  POSSIBILITY OF SUCH DAMAGE.
00033 *********************************************************************/
00034 
00035 /* Author: Ioan Sucan */
00036 
00037 #include "ompl/base/GoalStates.h"
00038 #include "ompl/base/SpaceInformation.h"
00039 #include "ompl/util/Exception.h"
00040 #include <limits>
00041 
00042 ompl::base::GoalStates::~GoalStates(void)
00043 {
00044     freeMemory();
00045 }
00046 
00047 void ompl::base::GoalStates::clear(void)
00048 {
00049     freeMemory();
00050     states.clear();
00051 }
00052 
00053 void ompl::base::GoalStates::freeMemory(void)
00054 {
00055     for (unsigned int i = 0 ; i < states.size() ; ++i)
00056         si_->freeState(states[i]);
00057 }
00058 
00059 double ompl::base::GoalStates::distanceGoal(const State *st) const
00060 {
00061     double dist = std::numeric_limits<double>::infinity();
00062     for (unsigned int i = 0 ; i < states.size() ; ++i)
00063     {
00064         double d = si_->distance(st, states[i]);
00065         if (d < dist)
00066             dist = d;
00067     }
00068     return dist;
00069 }
00070 
00071 void ompl::base::GoalStates::print(std::ostream &out) const
00072 {
00073     out << states.size() << " goal states, threshold = " << threshold_ << ", memory address = " << this << std::endl;
00074     for (unsigned int i = 0 ; i < states.size() ; ++i)
00075     {
00076         si_->printState(states[i], out);
00077         out << std::endl;
00078     }
00079 }
00080 
00081 void ompl::base::GoalStates::sampleGoal(base::State *st) const
00082 {
00083     if (states.empty())
00084         throw Exception("There are no goals to sample");
00085     si_->copyState(st, states[samplePosition]);
00086     samplePosition = (samplePosition + 1) % states.size();
00087 }
00088 
00089 unsigned int ompl::base::GoalStates::maxSampleCount(void) const
00090 {
00091     return states.size();
00092 }
00093 
00094 void ompl::base::GoalStates::addState(const State* st)
00095 {
00096     states.push_back(si_->cloneState(st));
00097 }
00098 
00099 void ompl::base::GoalStates::addState(const ScopedState<> &st)
00100 {
00101     addState(st.get());
00102 }