AgentsSourcesManager.cpp 14.2 KB
Newer Older
1 2 3
/**
 * \file        AgentsSourcesManager.cpp
 * \date        Apr 14, 2015
4 5
 * \version     v0.7
 * \copyright   <2009-2015> Forschungszentrum Jülich GmbH. All rights reserved.
6
 *
7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28
 * \section License
 * This file is part of JuPedSim.
 *
 * JuPedSim is free software: you can redistribute it and/or modify
 * it under the terms of the GNU Lesser General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * any later version.
 *
 * JuPedSim is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public License
 * along with JuPedSim. If not, see <http://www.gnu.org/licenses/>.
 *
 * \section Description
 * This class is responsible for materialising agent in a given location at a given frequency up to a maximum number.
 * The optimal position where to put the agents is given by various algorithms, for instance
 * the Voronoi algorithm or the Mitchell Best candidate algorithm.
 *
 **/
29 30 31

#include "AgentsSourcesManager.h"
#include "Pedestrian.h"
32 33
#include "StartDistribution.h"
#include "PedDistributor.h"
34
#include "AgentsSource.h"
35 36
#include "../voronoi/VoronoiDiagramGenerator.h"
#include "../geometry/Building.h"
37 38
#include "../geometry/Point.h"

39

40
#include "../mpi/LCGrid.h"
41 42 43
#include <iostream>
#include <thread>
#include <chrono>
44
#include "AgentsQueue.h"
45 46 47

using namespace std;

48
bool AgentsSourcesManager::_isCompleted=true;
49

50 51 52 53 54 55 56 57
AgentsSourcesManager::AgentsSourcesManager()
{
}

AgentsSourcesManager::~AgentsSourcesManager()
{
}

58
void AgentsSourcesManager::operator()()
59
{
60
     Run();
61
}
62

63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95
void AgentsSourcesManager::Run()
{
     Log->Write("INFO:\tStarting agent manager thread");

     //Generate all agents required for the complete simulation
     //It might be more efficient to generate at each frequency step
     for (const auto& src : _sources)
     {
          src->GenerateAgentsAndAddToPool(src->GetMaxAgents(), _building);
     }

     //first call ignoring the return value
     ProcessAllSources();

     //the loop is updated each x second.
     //it might be better to use a timer
     _isCompleted = false;
     bool finished = false;
     long updateFrequency = 5;     // 1 second
     do
     {
          int current_time = Pedestrian::GetGlobalTime();

          if ((current_time != _lastUpdateTime)
                    && ((current_time % updateFrequency) == 0))
          {
               finished=ProcessAllSources();
               _lastUpdateTime = current_time;
          }
          //wait some time
          //std::this_thread::sleep_for(std::chrono::milliseconds(1));
     } while (!finished);
     Log->Write("INFO:\tTerminating agent manager thread");
96
     _isCompleted = true;
97 98 99
}

bool AgentsSourcesManager::ProcessAllSources() const
100 101 102 103
{
     bool empty=true;
     for (const auto& src : _sources)
     {
Ulrich Kemloh's avatar
Ulrich Kemloh committed
104

105 106 107
          if (src->GetPoolSize())
          {
               vector<Pedestrian*> peds;
108
               src->RemoveAgentsFromPool(peds,src->GetFrequency());
Ulrich Kemloh's avatar
Ulrich Kemloh committed
109
               Log->Write("INFO:\tSource %d generating %d agents (%d remaining)",src->GetId(),peds.size(),src->GetPoolSize());
110

111
               ComputeBestPositionRandom(src.get(), peds);
112 113 114
               //todo: compute the optimal position for insertion using voronoi
               //for (auto&& ped : peds)
               //{
115 116
               //ComputeBestPositionVoronoi(src.get(), ped);
               //ped->Dump(ped->GetID());
117
               //}
118
               AgentsQueueIn::Add(peds);
119 120 121 122 123
               empty = false;
          }
          //src->Dump();//exit(0);
     }
     return empty;
124 125
}

126
void AgentsSourcesManager::ComputeBestPositionVoronoi(AgentsSource* src,
127
          Pedestrian* agent) const
128
{
129 130 131 132 133
     auto dist = src->GetStartDistribution();
     double bounds[4];
     dist->Getbounds(bounds);
     int roomID = dist->GetRoomId();
     int subroomID = dist->GetSubroomID();
134 135 136

     //Get all pedestrians in that location
     vector<Pedestrian*> peds;
137
     _building->GetPedestrians(roomID, subroomID, peds);
138

139
     //filter the points that are not within the boundaries
140 141 142 143 144 145 146
     for (auto&& iter = peds.begin(); iter != peds.end();)
     {
          const Point& pos = (*iter)->GetPos();
          if ((bounds[0] <= pos._x && pos._x <= bounds[1])
                    && (bounds[1] <= pos._y && pos._y <= bounds[2]))
          {
               iter = peds.erase(iter);
Ulrich Kemloh's avatar
Ulrich Kemloh committed
147
               cout << "removing (testing only)..." << endl;
148
               exit(0);
149
          } else
150 151 152 153 154 155 156 157
          {
               ++iter;
          }
     }

     //special case with 1, 2 or only three pedestrians in the area
     if (peds.size() < 3)
     {
158 159
          //TODO/random position in the area
          return;
160 161

     }
162
     // compute the cells and cut with the bounds
163
     const int count = peds.size();
164 165
     float* xValues = new float[count];
     float* yValues = new float[count];
166 167
     //float xValues[count];
     //float yValues[count];
168

169
     for (int i = 0; i < count; i++)
170
     {
171 172
          xValues[i] = peds[i]->GetPos()._x;
          yValues[i] = peds[i]->GetPos()._y;
173 174 175
     }

     VoronoiDiagramGenerator vdg;
176 177
     vdg.generateVoronoi(xValues, yValues, count, bounds[0], bounds[1],
               bounds[2], bounds[3], 3);
178 179 180 181
     vdg.resetIterator();
     vdg.resetVerticesIterator();

     printf("\n------vertices---------\n");
182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210
     //collect the positions
     vector<Point> positions;
     float x1, y1;
     while (vdg.getNextVertex(x1, y1))
     {
          printf("GOT Point (%f,%f)\n", x1, y1);
          positions.push_back(Point(x1, y1));
     }

     //look for the biggest spot
     map<double, Point> map_dist_to_position;

     for (auto&& pos : positions)
     {
          double min_dist = FLT_MAX;

          for (auto&& ped : peds)
          {
               double dist = (pos - ped->GetPos()).NormSquare();
               if (dist < min_dist)
               {
                    min_dist = dist;
               }
          }
          map_dist_to_position[min_dist] = pos;
     }

     //list the result
     for (auto&& mp : map_dist_to_position)
211
     {
212
          cout << "dist: " << mp.first << " pos: " << mp.second.toString()
213
                                        << endl;
214
          //agent->SetPos(mp.second, true);
215 216
     }

217 218 219 220 221 222 223
     //the elements are ordered.
     // so the last one has the largest distance
     if (!map_dist_to_position.empty())
     {
          agent->SetPos(map_dist_to_position.rbegin()->second, true);
          cout << "position:" << agent->GetPos().toString() << endl;
          //exit(0);
224

225
     } else
226 227 228
     {
          cout << "position not set:" << endl;
          cout << "size: " << map_dist_to_position.size() << endl;
229
          cout << " for " << peds.size() << " pedestrians" << endl;
230 231
          exit(0);
     }
232 233 234 235 236 237 238 239
     //exit(0);
     // float x1,y1,x2,y2;
     //while(vdg.getNext(x1,y1,x2,y2))
     //{
     //     printf("GOT Line (%f,%f)->(%f,%f)\n",x1,y1,x2, y2);
     //
     //}
     //compute the best position
240
     //exit(0);
241 242
}

243
void AgentsSourcesManager::ComputeBestPositionRandom(AgentsSource* src,
244
          std::vector<Pedestrian*>& peds) const
245 246 247
{

     //generate the agents with default positions
248 249 250 251 252
     auto dist = src->GetStartDistribution();
     auto subroom = _building->GetRoom(dist->GetRoomId())->GetSubRoom(
               dist->GetSubroomID());
     vector<Point> positions = PedDistributor::PossiblePositions(*subroom);
     double bounds[4] = { 0, 0, 0, 0 };
253 254
     dist->Getbounds(bounds);

255 256
     vector<Point> extra_positions;

257
     for (auto& ped : peds)
258
     {
259 260 261
          //need to be called at each iteration
          SortPositionByDensity(positions, extra_positions);

262 263 264
          int index = -1;

          //in the case a range was specified
265
          //just take the first element
266
          for (unsigned int a = 0; a < positions.size(); a++)
267
          {
268
               Point pos = positions[a];
269
               //cout<<"checking: "<<pos.toString()<<endl;
270 271
               if ((bounds[0] <= pos._x) && (pos._x <= bounds[1])
                         && (bounds[2] <= pos._y) && (pos._y < bounds[3]))
272
               {
273
                    index = a;
274 275 276
                    break;
               }
          }
277
          if (index == -1)
278
          {
279
               if (positions.size())
280
               {
281
                    Log->Write(
282
                              "ERROR:\t AgentSourceManager Cannot distribute pedestrians in the mentioned area [%0.2f,%0.2f,%0.2f,%0.2f]",
283
                              bounds[0], bounds[1], bounds[2], bounds[3]);
284 285 286
                    Log->Write("     \t Specifying a subroom_id might help");
                    Log->Write("     \t %d positions were available",positions.size());
                    exit(EXIT_FAILURE);
287
               }
288 289
          }
          else
290 291
          {
               const Point& pos = positions[index];
292
               extra_positions.push_back(pos);
293
               ped->SetPos(pos, true); //true for the initial position
294 295
               positions.erase(positions.begin() + index);

296
               //at this point we have a position
297 298 299
               //so we can adjust the velocity
               //AdjustVelocityUsingWeidmann(ped);
               AdjustVelocityByNeighbour(ped);
300 301 302
          }
     }
}
303

304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359
void AgentsSourcesManager::AdjustVelocityByNeighbour(Pedestrian* ped) const
{
     //get the density
     vector<Pedestrian*> neighbours;
     _building->GetGrid()->GetNeighbourhood(ped,neighbours);

     double speed=0.0;
     double radius_square=0.56*0.56;//corresponding to an area of 1m3
     int count=0;

     for(const auto& p: neighbours)
     {
          //only pedes in a sepcific rance
          if( (ped->GetPos()-p->GetPos()).NormSquare()<=radius_square)
          {
               //only peds with the same destination
               if(ped->GetExitIndex()==p->GetExitIndex())
               {
                    double dist1=ped->GetDistanceToNextTarget();
                    double dist2=p->GetDistanceToNextTarget();
                    //only peds in front of me
                    if(dist2<dist1)
                    {
                         speed+=p->GetV().Norm();
                         count++;
                    }
               }
          }

     }
     //mean speed
     if(count==0)
     {
          speed=ped->GetV0Norm();
     }
     else
     {
          speed=speed/count;
     }

     if(ped->FindRoute()!=-1)
     {
          //get the next destination point
          Point v =(ped->GetExitLine()->ShortestPoint(ped->GetPos())- ped->GetPos()).Normalized();
          v=v*speed;
          ped->SetV(v);
     }
     else
     {
          Log->Write("ERROR:\t no route could be found for agent [%d] going to [%d]",ped->GetID(),ped->GetFinalDestination());
          //that will be most probably be fixed in the next computation step.
          // so do not abort
     }

}

360 361 362 363 364 365
void AgentsSourcesManager::AdjustVelocityUsingWeidmann(Pedestrian* ped) const
{
     //get the density
     vector<Pedestrian*> neighbours;
     _building->GetGrid()->GetNeighbourhood(ped,neighbours);

366
     //density in pers per m2
367 368
     double density = 1.0;
     //radius corresponding to a surface of 1m2
369
     //double radius_square=0.564*0.564;
370
     double radius_square=1.0;
371

372 373
     for(const auto& p: neighbours)
     {
374
          if( (ped->GetPos()-p->GetPos()).NormSquare()<=radius_square)
375 376
               density+=1.0;
     }
377 378
     density=density/(radius_square*M_PI);

379 380
     //get the velocity
     double density_max=5.4;
381

382 383 384 385 386 387
     //speed from taken from weidmann FD
     double speed=1.34*(1-exp(-1.913*(1.0/density-1.0/density_max)));
     if(speed>=ped->GetV0Norm())
     {
          speed=ped->GetV0Norm();
     }
388

389 390
     //set the velocity vector
     if(ped->FindRoute()!=-1)
391 392 393 394 395
     {
          //get the next destination point
          Point v =(ped->GetExitLine()->ShortestPoint(ped->GetPos())- ped->GetPos()).Normalized();
          v=v*speed;
          ped->SetV(v);
396
          //cout<<"density: "<<density<<endl;
397 398 399 400
     }
     else
     {
          Log->Write("ERROR:\t no route could be found for agent [%d] going to [%d]",ped->GetID(),ped->GetFinalDestination());
401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443
          //that will be most probably be fixed in the next computation step.
          // so do not abort
     }

}

void AgentsSourcesManager::SortPositionByDensity(std::vector<Point>& positions, std::vector<Point>& extra_positions) const
{
     std::multimap<double,Point> density2pt;
     //std::map<double,Point> density2pt;

     for(auto&& pt:positions)
     {
          vector<Pedestrian*> neighbours;
          _building->GetGrid()->GetNeighbourhood(pt,neighbours);
          //density in pers per m2
          double density = 0.0;
          double radius_square=0.40*0.40;

          for(const auto& p: neighbours)
          {
               if( (pt-p->GetPos()).NormSquare()<=radius_square)
                    density+=1.0;
          }

          //consider the extra positions
          for(const auto& ptx: extra_positions)
          {
               if( (ptx-pt).NormSquare()<=radius_square)
                    density+=1.0;
          }
          density=density/(radius_square*M_PI);

          density2pt.insert(std::pair<double,Point>(density,pt));

     }

     //cout<<"------------------"<<positions.size()<<"-------"<<endl;
     positions.clear();
     for(auto&& d: density2pt)
     {
          positions.push_back(d.second);
          //     printf("density [%lf, %s]\n",d.first, d.second.toString().c_str());
444
     }
445 446

}
447 448 449 450 451 452 453 454 455 456 457


void AgentsSourcesManager::GenerateAgents()
{

     for (const auto& src : _sources)
     {
          src->GenerateAgentsAndAddToPool(src->GetMaxAgents(), _building);
     }
}

458 459 460
void AgentsSourcesManager::AddSource(std::shared_ptr<AgentsSource> src)
{
     _sources.push_back(src);
461
     _isCompleted=false;//at least one source was provided
462 463 464 465 466 467
}

const std::vector<std::shared_ptr<AgentsSource> >& AgentsSourcesManager::GetSources() const
{
     return _sources;
}
468 469 470

void AgentsSourcesManager::SetBuilding(Building* building)
{
471
     _building = building;
472
}
473 474 475

bool AgentsSourcesManager::IsCompleted() const
{
476
     return _isCompleted;
477
}
478 479 480 481 482 483


Building* AgentsSourcesManager::GetBuilding() const
{
     return _building;
}
484 485 486 487 488 489 490 491 492 493

long AgentsSourcesManager::GetMaxAgentNumber() const
{
     long pop=0;
     for (const auto& src : _sources)
     {
          pop+=src->GetMaxAgents();
     }
     return pop;
}