[814] | 1 | |
---|
| 2 | /*! |
---|
| 3 | \file |
---|
[819] | 4 | \brief Distributed Traffic light Control Scenario |
---|
| 5 | \author Vasek Smidl |
---|
[814] | 6 | |
---|
| 7 | */ |
---|
| 8 | |
---|
| 9 | #include "base/user_info.h" |
---|
| 10 | #include "base/loggers.h" |
---|
[840] | 11 | #ifdef _WIN32 |
---|
[814] | 12 | #include "aimsun_bdm/aimsun_ds.h" |
---|
[840] | 13 | #else |
---|
| 14 | #include "aimsun_bdm/aimsun_fake.h" |
---|
| 15 | #endif |
---|
[819] | 16 | #include "traffic_agent.h" |
---|
[921] | 17 | #include "traffic_agent_offset.h" |
---|
[814] | 18 | |
---|
[819] | 19 | using namespace bdm; |
---|
[814] | 20 | |
---|
| 21 | int main ( int argc, char* argv[] ) { |
---|
| 22 | const char *fname; |
---|
| 23 | if ( argc>1 ) {fname = argv[1]; } |
---|
| 24 | else { cout << "Missing configuration file.\n Usage: \n $> estimator config_file.cfg"<<endl; abort(); } |
---|
[819] | 25 | UIFile Cfg ( fname ); |
---|
[814] | 26 | |
---|
[819] | 27 | // SYSTEM TO CONTROL |
---|
[903] | 28 | shared_ptr<AimsunDS> Ds=UI::build<AimsunDS>(Cfg.lookup("system"),UI::compulsory); |
---|
[814] | 29 | |
---|
[819] | 30 | // AGENTS |
---|
| 31 | Array<shared_ptr<Participant> > Ags; |
---|
| 32 | UI::get ( Ags,Cfg, "agents" ); |
---|
| 33 | |
---|
| 34 | // LOGGER |
---|
| 35 | shared_ptr<logger> L = UI::build <logger>( Cfg, "logger" ); |
---|
| 36 | if (!L) {L=new stdlog();} // DEFAULT LOGGER <== poor choice, use better ones |
---|
| 37 | |
---|
| 38 | Config MsgStore; |
---|
| 39 | MsgStore.setAutoConvert(true); |
---|
| 40 | Setting& Queue = MsgStore.getRoot().add("queue", Setting::TypeList); |
---|
| 41 | |
---|
| 42 | // REGISTER ACTIVE OBJECTS IN LOGGER |
---|
[903] | 43 | Ds->log_register ( *L, "DS" ); |
---|
[819] | 44 | for ( int i=0; i<Ags.length(); i++ ) { |
---|
| 45 | Ags ( i )->log_register ( *L,Ags(i)->_name() ); // estimate |
---|
[903] | 46 | Ags ( i )->ds_register(*Ds); // allows agents to update their datalinks |
---|
[819] | 47 | } |
---|
| 48 | L->init(); |
---|
| 49 | |
---|
[903] | 50 | vec glob_dt(Ds->_drv()._dsize() ); |
---|
| 51 | vec glob_ut(Ds->_urv()._dsize() ); |
---|
[832] | 52 | |
---|
| 53 | // INITIALISATION OF UT |
---|
| 54 | glob_ut[ 0] = 80; // cycle time |
---|
[921] | 55 | glob_ut[ 1] = 40; // offset 495 |
---|
[832] | 56 | glob_ut[ 2] = 30; // ut[2]+ut[3]+ut[4] has to sum up to ut[0] |
---|
| 57 | glob_ut[ 3] = 30; |
---|
| 58 | glob_ut[ 4] = 20; |
---|
[921] | 59 | glob_ut[ 8] = 20; // offset 601 |
---|
[832] | 60 | glob_ut[ 9] = 30; // ut[9]+ut[10]+ut[11] has to sum up to ut[0] |
---|
| 61 | glob_ut[10] = 30; |
---|
| 62 | glob_ut[11] = 20; |
---|
| 63 | |
---|
[903] | 64 | for ( int tK=0; tK < Ds->max_length(); tK++ ) { |
---|
| 65 | Ds->log_write ( ); // write stuff to |
---|
| 66 | Ds->getdata(glob_dt); |
---|
[819] | 67 | |
---|
| 68 | for ( int i=0; i<Ags.length(); i++ ) { |
---|
| 69 | Ags(i) -> adapt(glob_dt); |
---|
| 70 | } |
---|
[927] | 71 | |
---|
| 72 | // NEGOTIATION CYCLE |
---|
[819] | 73 | for ( int i=0; i<Ags.length(); i++ ) { |
---|
| 74 | Ags(i) -> broadcast(Queue); |
---|
| 75 | } |
---|
[840] | 76 | //DBG |
---|
| 77 | MsgStore.writeFile("xxx"); |
---|
[819] | 78 | // parse message queue |
---|
| 79 | for ( int m=Queue.getLength()-1; m>=0; m-- ) { // go backwards - last mesages are discarded |
---|
| 80 | for ( int i=0; i<Ags.length(); i++ ) { |
---|
| 81 | Setting& msg=Queue[m]; |
---|
| 82 | string m_to=msg["to"]; |
---|
| 83 | if (m_to==Ags(i)->_name()) { |
---|
| 84 | Ags(i)->receive(msg); |
---|
| 85 | Queue.remove(m); |
---|
| 86 | break; |
---|
| 87 | // message delivered; |
---|
| 88 | } |
---|
| 89 | } |
---|
| 90 | } |
---|
| 91 | if (Queue.getLength()>0){bdm_error("undelivered messages - probably unknown neighbours");} |
---|
| 92 | |
---|
| 93 | for ( int i=0; i<Ags.length(); i++ ) { |
---|
| 94 | Ags(i) -> act(glob_ut); |
---|
| 95 | } |
---|
| 96 | |
---|
| 97 | L->step(); |
---|
[903] | 98 | Ds->write(glob_ut); |
---|
| 99 | Ds->step(); // simulator step |
---|
[819] | 100 | |
---|
| 101 | for ( int i=0; i<Ags.length(); i++ ) { |
---|
[840] | 102 | Ags(i) -> log_write(); |
---|
[819] | 103 | Ags(i) -> step(); |
---|
| 104 | } |
---|
| 105 | |
---|
| 106 | } |
---|
| 107 | |
---|
[814] | 108 | L->finalize(); |
---|
| 109 | |
---|
| 110 | return 0; |
---|
| 111 | } |
---|