AgentsSourcesManager.cpp 16.9 KB
Newer Older
1 2 3 4 5
/**
 * \file        AgentsSourcesManager.cpp
 * \date        Apr 14, 2015
 * \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
#include "../geometry/Building.h"
36 37
#include "../geometry/Point.h"

38
#include "../mpi/LCGrid.h"
39 40 41
#include <iostream>
#include <thread>
#include <chrono>
42
#include "AgentsQueue.h"
43

44 45
#include "../voronoi-boost/VoronoiPositionGenerator.h"

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
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;
81
     long updateFrequency = 2;     // 1 = second
82 83 84 85 86 87 88 89 90 91 92
     do
     {
          int current_time = Pedestrian::GetGlobalTime();

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

bool AgentsSourcesManager::ProcessAllSources() const
100 101 102 103 104 105
{
     bool empty=true;
     for (const auto& src : _sources)
     {
          if (src->GetPoolSize())
          {
106
               vector<Pedestrian*> peds;
107
               src->RemoveAgentsFromPool(peds,src->GetFrequency());
108
               Log->Write("INFO:\tSource %d generating %d agents (%d remaining)",src->GetId(),peds.size(),src->GetPoolSize());
109

110
               //ComputeBestPositionRandom(src.get(), peds);
111
               //todo: compute the optimal position for insertion using voronoi
112 113
               if( !ComputeBestPositionVoronoiBoost(src.get(), peds, _building) )
                    Log->Write("INFO:\t there was no place for some pedestrians");
114
               AgentsQueueIn::Add(peds);
115 116 117 118 119
               empty = false;
          }
          //src->Dump();//exit(0);
     }
     return empty;
120
}
121

122 123 124 125 126 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
//4 agents frequency, just for an example
void AgentsSourcesManager::ComputeBestPositionDummy(AgentsSource* src,
          vector<Pedestrian*>& peds)const
{
     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;
          }
     }

}

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

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

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

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

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

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

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

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

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

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

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


293

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

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

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

308 309
     vector<Point> extra_positions;

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

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

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

            	   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;
				   }

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

371 372 373 374 375 376 377 378 379 380 381
			   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++;

382
          }
383 384

          //return the pedestrians without place
385
     }
386 387
     if(peds_without_place.size()>0)
         src->AddAgentsToPool(peds_without_place);
388
}
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
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)
     {
423
          speed=ped->GetEllipse().GetV0(); // FIXME:  bad fix for: peds without navline (ar.graf) 
424
          //speed=ped->GetV0Norm();
425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446
     }
     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
     }

}

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

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

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

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

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

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

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


void AgentsSourcesManager::GenerateAgents()
{

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

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

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

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

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


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

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