ilqgames
A new real-time solver for large-scale differential games.
player_cost_cache.h
1 /*
2  * Copyright (c) 2019, The Regents of the University of California (Regents).
3  * All rights reserved.
4  *
5  * Redistribution and use in source and binary forms, with or without
6  * modification, are permitted provided that the following conditions are
7  * met:
8  *
9  * 1. Redistributions of source code must retain the above copyright
10  * notice, this list of conditions and the following disclaimer.
11  *
12  * 2. Redistributions in binary form must reproduce the above
13  * copyright notice, this list of conditions and the following
14  * disclaimer in the documentation and/or other materials provided
15  * with the distribution.
16  *
17  * 3. Neither the name of the copyright holder nor the names of its
18  * contributors may be used to endorse or promote products derived
19  * from 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 HOLDER 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  * Please contact the author(s) of this library if you have any questions.
34  * Authors: David Fridovich-Keil ( dfk@eecs.berkeley.edu )
35  */
36 
37 ///////////////////////////////////////////////////////////////////////////////
38 //
39 // Storage utility for inspecting player costs corresponding to a log.
40 //
41 ///////////////////////////////////////////////////////////////////////////////
42 
43 #ifndef ILQGAMES_UTILS_PLAYER_COST_CACHE_H
44 #define ILQGAMES_UTILS_PLAYER_COST_CACHE_H
45 
46 #include <ilqgames/cost/player_cost.h>
47 #include <ilqgames/dynamics/multi_player_flat_system.h>
48 #include <ilqgames/utils/operating_point.h>
49 #include <ilqgames/utils/solver_log.h>
50 #include <ilqgames/utils/types.h>
51 
52 #include <glog/logging.h>
53 #include <memory>
54 #include <unordered_map>
55 #include <vector>
56 
57 namespace ilqgames {
58 
60  public:
61  ~PlayerCostCache() {}
62  PlayerCostCache(const std::shared_ptr<const SolverLog>& log,
63  const std::vector<PlayerCost>& player_costs);
64 
65  // Interpolate the given cost at the specified iterate and time.
66  float Interpolate(size_t iterate, Time t, PlayerIndex player,
67  const std::string& name) const;
68 
69  // Accessors.
70  const SolverLog& Log() const { return *log_; }
71  size_t NumPlayers() const { return evaluated_player_costs_.size(); }
72  size_t NumCosts(PlayerIndex player) const {
73  return evaluated_player_costs_[player].size();
74  }
75  bool PlayerHasCost(PlayerIndex player, const std::string& name) const {
76  return evaluated_player_costs_[player].count(name) > 0;
77  }
78  const std::unordered_map<std::string, std::vector<std::vector<float>>>&
79  EvaluatedCosts(PlayerIndex player) const {
80  return evaluated_player_costs_[player];
81  }
82  const std::vector<float>& EvaluatedCost(size_t iterate, PlayerIndex player,
83  const std::string& name) const {
84  CHECK(PlayerHasCost(player, name));
85  CHECK_LT(iterate, evaluated_player_costs_[player].at(name).size());
86 
87  return evaluated_player_costs_[player].at(name)[iterate];
88  }
89 
90  private:
91  // Log. Currently only used for converting between times and time steps.
92  const std::shared_ptr<const SolverLog> log_;
93 
94  // Player costs (indexed by player and string ID) evaluated every iterate
95  // and time step.
96  std::vector<std::unordered_map<std::string, std::vector<std::vector<float>>>>
97  evaluated_player_costs_;
98 }; // class PlayerCostCache
99 
100 } // namespace ilqgames
101 
102 #endif