AgentsSourcesManager.cpp 17.2 KB
Newer Older
1 2 3 4
/**
 * \file        AgentsSourcesManager.cpp
 * \date        Apr 14, 2015
 * \version     v0.7
Mohcine Chraibi's avatar
Mohcine Chraibi committed
5
 * \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 "../mpi/LCGrid.h"
34
#include <thread>
35
#include "AgentsQueue.h"
36

37
#include "../voronoi-boost/VoronoiPositionGenerator.h"
Mohcine Chraibi's avatar
Mohcine Chraibi committed
38
#define UNUSED(x) [&x]{}()  // c++11 silence warnings
39

40 41
using namespace std;

42
bool AgentsSourcesManager::_isCompleted=true;
43

44 45 46 47 48 49 50 51
AgentsSourcesManager::AgentsSourcesManager()
{
}

AgentsSourcesManager::~AgentsSourcesManager()
{
}

52
void AgentsSourcesManager::operator()()
53
{
54
     Run();
55
}
56

57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74
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;
75
     long updateFrequency = 1; //TODO parse this from inifile
76
     do
Mohcine Chraibi's avatar
Mohcine Chraibi committed
77
     { //@todo: break if max simulation time is reached.
Mohcine Chraibi's avatar
Mohcine Chraibi committed
78
          int current_time = (int)Pedestrian::GetGlobalTime();
79 80
          if ((current_time != _lastUpdateTime)
                    && ((current_time % updateFrequency) == 0))
Mohcine Chraibi's avatar
Mohcine Chraibi committed
81
          {   
82 83 84 85
               finished=ProcessAllSources();
               _lastUpdateTime = current_time;
          }
          //wait some time
86
          // std::this_thread::sleep_for(std::chrono::milliseconds(1));
87 88
     } while (!finished);
     Log->Write("INFO:\tTerminating agent manager thread");
89
     _isCompleted = true;
90 91 92
}

bool AgentsSourcesManager::ProcessAllSources() const
93 94
{
     bool empty=true;
95
     double current_time = Pedestrian::GetGlobalTime();
Mohcine Chraibi's avatar
Mohcine Chraibi committed
96
//     std::cout << "\n -- current time: " << current_time << " number " << _building->GetAllPedestrians().size() << std::endl;
97 98
     for (const auto& src : _sources)
     {
99
          if (src->GetPoolSize() && (src->GetPlanTime() <= current_time) )// maybe diff<eps
100
          {
101
               vector<Pedestrian*> peds;
102
               src->RemoveAgentsFromPool(peds,src->GetFrequency());
103
               Log->Write("INFO:\tSource %d generating %d agents (%d remaining)",src->GetId(),peds.size(),src->GetPoolSize());
104

105
               //ComputeBestPositionRandom(src.get(), peds);
Mohcine Chraibi's avatar
Mohcine Chraibi committed
106
               //todo: here every pedestrian needs an exitline
107
               if( !ComputeBestPositionVoronoiBoost(src.get(), peds, _building) )
108
                    Log->Write("WARNING:\tThere was no place for some pedestrians");
109

110
               AgentsQueueIn::Add(peds);
111
               empty = false;
Mohcine Chraibi's avatar
Mohcine Chraibi committed
112
               //src->Dump();
113
          }
114 115 116
          if (src->GetPlanTime() > current_time) // for the case we still expect
                                                 // agents coming
               empty = false;
117 118 119
          //src->Dump();//exit(0);
     }
     return empty;
120
}
121

122 123 124 125
//4 agents frequency, just for an example
void AgentsSourcesManager::ComputeBestPositionDummy(AgentsSource* src,
          vector<Pedestrian*>& peds)const
{
Mohcine Chraibi's avatar
Mohcine Chraibi committed
126
     UNUSED(src); 
127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174
     peds[0]->SetPos( Point(10,5.5) );
     peds[1]->SetPos( Point(10,4.9) );
     peds[2]->SetPos( Point(10,4.3) );
     peds[3]->SetPos( Point(10,3.7) );

     /*peds[0]->SetPos( Point(10,5.4) );
	peds[1]->SetPos( Point(10,4.6) );
	peds[2]->SetPos( Point(10,3.8) );*/

     for(auto&& ped : peds)
     {
          Point v = (ped->GetExitLine()->ShortestPoint(ped->GetPos())- ped->GetPos()).Normalized();
          double speed=ped->GetV0Norm();
          v=v*speed;
          ped->SetV(v);
     }
}

void AgentsSourcesManager::ComputeBestPositionCompleteRandom(AgentsSource* src,
          vector<Pedestrian*>& peds)const
{
     auto dist = src->GetStartDistribution();
     auto subroom = _building->GetRoom(dist->GetRoomId())->GetSubRoom(dist->GetSubroomID());
     vector<Point> positions = PedDistributor::PossiblePositions(*subroom);

     //TODO: get the seed from the simulation
     srand (time(NULL));

     for (auto& ped : peds)
     {
          if( positions.size() )
          {
               int index = rand()%positions.size();
               Point new_pos = positions[index];
               positions.erase(positions.begin() + index);
               ped->SetPos(new_pos, true);
               AdjustVelocityByNeighbour(ped);
          }
          else
          {
               Log->Write("\t No place for a pedestrian");
               break;
          }
     }

}

/*
175
void AgentsSourcesManager::ComputeBestPositionVoronoi(AgentsSource* src,
176
          Pedestrian* agent) const
177
{
178 179 180 181 182
     auto dist = src->GetStartDistribution();
     double bounds[4];
     dist->Getbounds(bounds);
     int roomID = dist->GetRoomId();
     int subroomID = dist->GetSubroomID();
183 184 185

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

188
     //filter the points that are not within the boundaries
189 190 191 192 193 194 195
     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);
196
               cout << "removing (testing only)..." << endl;
197
               exit(0);
198
          } else
199 200 201 202 203 204 205 206
          {
               ++iter;
          }
     }

     //special case with 1, 2 or only three pedestrians in the area
     if (peds.size() < 3)
     {
207 208
          //TODO/random position in the area
          return;
209 210

     }
211
     // compute the cells and cut with the bounds
212
     const int count = peds.size();
213 214
     float* xValues = new float[count];
     float* yValues = new float[count];
215 216
     //float xValues[count];
     //float yValues[count];
217

218
     for (int i = 0; i < count; i++)
219
     {
220 221
          xValues[i] = peds[i]->GetPos()._x;
          yValues[i] = peds[i]->GetPos()._y;
222 223 224
     }

     VoronoiDiagramGenerator vdg;
225 226
     vdg.generateVoronoi(xValues, yValues, count, bounds[0], bounds[1],
               bounds[2], bounds[3], 3);
227 228 229 230
     vdg.resetIterator();
     vdg.resetVerticesIterator();

     printf("\n------vertices---------\n");
231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248
     //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)
          {
249 250
               double dist = (pos - ped->GetPos()).NormSquare();
               if (dist < min_dist)
251
               {
252
                    min_dist = dist;
253 254 255 256 257 258 259
               }
          }
          map_dist_to_position[min_dist] = pos;
     }

     //list the result
     for (auto&& mp : map_dist_to_position)
260
     {
261
          cout << "dist: " << mp.first << " pos: " << mp.second.toString()
262
                                        << endl;
263
          //agent->SetPos(mp.second, true);
264 265
     }

266 267 268 269 270 271 272
     //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);
273

274
     } else
275 276 277
     {
          cout << "position not set:" << endl;
          cout << "size: " << map_dist_to_position.size() << endl;
278
          cout << " for " << peds.size() << " pedestrians" << endl;
279 280
          exit(0);
     }
281 282 283 284 285 286 287 288
     //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
289
     //exit(0);
290
}
291 292 293
 */


294

295
void AgentsSourcesManager::ComputeBestPositionRandom(AgentsSource* src,
296
          std::vector<Pedestrian*>& peds) const
297 298 299
{

     //generate the agents with default positions
300 301 302 303 304
     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 };
305 306
     dist->Getbounds(bounds);

307 308
     std::vector<Pedestrian*> peds_without_place;

309 310
     vector<Point> extra_positions;

311 312
     std::vector<Pedestrian*>::iterator iter_ped;
     for (iter_ped = peds.begin(); iter_ped != peds.end(); )
313
     {
314 315 316
          //need to be called at each iteration
          SortPositionByDensity(positions, extra_positions);

317
          int index = -1;
318
          double radius = ( (*iter_ped)->GetEllipse() ).GetBmax()   ;
319 320

          //in the case a range was specified
321
          //just take the first element
322
          for (unsigned int a = 0; a < positions.size(); a++)
323
          {
324
               Point pos = positions[a];
325 326
               //cout<<"checking: "<<pos.toString()<<endl;
               // for positions inside bounds, check it there is enough space
327 328
               if ((bounds[0] <= pos._x) && (pos._x <= bounds[1])
                         && (bounds[2] <= pos._y) && (pos._y < bounds[3]))
329
               {
330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350

            	   bool enough_space = true;

            	   //checking enough space!!
            	   vector<Pedestrian*> neighbours;
            	   _building->GetGrid()->GetNeighbourhood(pos,neighbours);

				   for (const auto& ngh: neighbours)
					   if(  (ngh->GetPos() - pos).NormSquare() < 4*radius*radius )
					   {
							enough_space = false;
							break;
					   }


				   if( enough_space )
				   {
					   index = a;
					   break;
				   }

351 352
               }
          }
353
          if (index == -1)
354
          {
355
               if (positions.size())
356
               {
357
                    Log->Write(
358
                              "ERROR:\t AgentSourceManager Cannot distribute pedestrians in the mentioned area [%0.2f,%0.2f,%0.2f,%0.2f]",
359
                              bounds[0], bounds[1], bounds[2], bounds[3]);
360 361 362
                    Log->Write("     \t Specifying a subroom_id might help");
                    Log->Write("     \t %d positions were available",positions.size());
                    //exit(EXIT_FAILURE);
363
               }
364 365 366
               //dump the pedestrian, move iterator
               peds_without_place.push_back(*iter_ped);
               iter_ped=peds.erase(iter_ped);
367
          }
368
          else //we found a position with enough space
369 370 371
          {
               const Point& pos = positions[index];

372 373 374 375 376 377 378 379 380 381 382
			   extra_positions.push_back(pos);
			   (*iter_ped)->SetPos(pos, true); //true for the initial position
			   positions.erase(positions.begin() + index);

			   //at this point we have a position
			   //so we can adjust the velocity
			   //AdjustVelocityUsingWeidmann(ped);
			   AdjustVelocityByNeighbour( (*iter_ped) );
			   //move iterator
			   iter_ped++;

383
          }
384 385

          //return the pedestrians without place
386
     }
387 388
     if(peds_without_place.size()>0)
         src->AddAgentsToPool(peds_without_place);
389
}
390

391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423
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)
     {
424
          speed=ped->GetEllipse().GetV0(); // FIXME:  bad fix for: peds without navline (ar.graf) 
425
          //speed=ped->GetV0Norm();
426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447
     }
     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
     }

}

448 449 450 451 452 453
void AgentsSourcesManager::AdjustVelocityUsingWeidmann(Pedestrian* ped) const
{
     //get the density
     vector<Pedestrian*> neighbours;
     _building->GetGrid()->GetNeighbourhood(ped,neighbours);

454
     //density in pers per m2
455 456
     double density = 1.0;
     //radius corresponding to a surface of 1m2
457
     //double radius_square=0.564*0.564;
458
     double radius_square=1.0;
459

460 461
     for(const auto& p: neighbours)
     {
462
          if( (ped->GetPos()-p->GetPos()).NormSquare()<=radius_square)
463 464
               density+=1.0;
     }
465 466
     density=density/(radius_square*M_PI);

467 468
     //get the velocity
     double density_max=5.4;
469

470 471 472 473 474 475
     //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();
     }
476

477 478
     //set the velocity vector
     if(ped->FindRoute()!=-1)
479 480 481 482 483
     {
          //get the next destination point
          Point v =(ped->GetExitLine()->ShortestPoint(ped->GetPos())- ped->GetPos()).Normalized();
          v=v*speed;
          ped->SetV(v);
484
          //cout<<"density: "<<density<<endl;
485 486 487 488
     }
     else
     {
          Log->Write("ERROR:\t no route could be found for agent [%d] going to [%d]",ped->GetID(),ped->GetFinalDestination());
489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509
          //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)
          {
510 511
              //FIXME: p  can be null, if deleted in the main simulation thread.
        	  if( p && (pt-p->GetPos()).NormSquare()<=radius_square)
512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532
                    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());
533
     }
534 535

}
536 537 538 539 540 541 542 543 544 545 546


void AgentsSourcesManager::GenerateAgents()
{

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

547 548 549
void AgentsSourcesManager::AddSource(std::shared_ptr<AgentsSource> src)
{
     _sources.push_back(src);
550
     _isCompleted=false;//at least one source was provided
551 552 553 554 555 556
}

const std::vector<std::shared_ptr<AgentsSource> >& AgentsSourcesManager::GetSources() const
{
     return _sources;
}
557 558 559

void AgentsSourcesManager::SetBuilding(Building* building)
{
560
     _building = building;
561
}
562 563 564

bool AgentsSourcesManager::IsCompleted() const
{
565
     return _isCompleted;
566
}
567 568 569 570 571 572


Building* AgentsSourcesManager::GetBuilding() const
{
     return _building;
}
573 574 575 576 577 578 579 580 581 582

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