<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" version="2.0">
  <channel>
    <title>Linux Embedded Challengeのトピック[project20]Cum fac sa simulez mai multe masini o data?</title>
    <link>https://community.nxp.com/t5/Linux-Embedded-Challenge/project20-Cum-fac-sa-simulez-mai-multe-masini-o-data/m-p/682822#M79</link>
    <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;Buna ziua.&lt;/P&gt;&lt;P&gt;Daca am inteles noi&amp;nbsp;bine, masinile trebuie tratate ca obiecte separate, ce isi pot modifica traseul pe parcurs - asta inseamna ca fiecare masina se va simula cu un obiect. Am invatat ceva POO de pe internet si am decis sa facem o functie in constructor, astfel incat o data ce o masina e declarata sa porneasca dintr-un nod terminal si sa ajunga in alt nod, simuland trecerea prin adunari si scaderi la muchiile pe care le parcurge, traseul fiind obtinut prin algoritmul lui Dijkstra.&amp;nbsp;&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;Problema este urmatoarea: programul ruleaza secvential, fiecare masina fiind declarata, parcurgandu-si drumul si apoi apelandu-se destructorul - apoi fiind declarata urmatoarea masina, si tot asa... deci nu se ajunge la simularea traficului.&amp;nbsp;&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;Ne puteti da vreun hint despre cum putem implementa asta?&amp;nbsp;&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;Va multumim.&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
    <pubDate>Wed, 17 May 2017 15:57:44 GMT</pubDate>
    <dc:creator>andreicana</dc:creator>
    <dc:date>2017-05-17T15:57:44Z</dc:date>
    <item>
      <title>[project20]Cum fac sa simulez mai multe masini o data?</title>
      <link>https://community.nxp.com/t5/Linux-Embedded-Challenge/project20-Cum-fac-sa-simulez-mai-multe-masini-o-data/m-p/682822#M79</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;Buna ziua.&lt;/P&gt;&lt;P&gt;Daca am inteles noi&amp;nbsp;bine, masinile trebuie tratate ca obiecte separate, ce isi pot modifica traseul pe parcurs - asta inseamna ca fiecare masina se va simula cu un obiect. Am invatat ceva POO de pe internet si am decis sa facem o functie in constructor, astfel incat o data ce o masina e declarata sa porneasca dintr-un nod terminal si sa ajunga in alt nod, simuland trecerea prin adunari si scaderi la muchiile pe care le parcurge, traseul fiind obtinut prin algoritmul lui Dijkstra.&amp;nbsp;&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;Problema este urmatoarea: programul ruleaza secvential, fiecare masina fiind declarata, parcurgandu-si drumul si apoi apelandu-se destructorul - apoi fiind declarata urmatoarea masina, si tot asa... deci nu se ajunge la simularea traficului.&amp;nbsp;&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;Ne puteti da vreun hint despre cum putem implementa asta?&amp;nbsp;&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;Va multumim.&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Wed, 17 May 2017 15:57:44 GMT</pubDate>
      <guid>https://community.nxp.com/t5/Linux-Embedded-Challenge/project20-Cum-fac-sa-simulez-mai-multe-masini-o-data/m-p/682822#M79</guid>
      <dc:creator>andreicana</dc:creator>
      <dc:date>2017-05-17T15:57:44Z</dc:date>
    </item>
    <item>
      <title>Re: [project20]Cum fac sa simulez mai multe masini o data?</title>
      <link>https://community.nxp.com/t5/Linux-Embedded-Challenge/project20-Cum-fac-sa-simulez-mai-multe-masini-o-data/m-p/682823#M80</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;Salut,&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;Pentru acest proiect puteti considera 2 categorii de masini:&lt;/P&gt;&lt;P&gt;1) Cele din "traficul existent" (pentru care puteti stabili niste trasee fixe inainte simularii propriu-zise, urmand ca ele sa parcurga acele trasee fara modificari ulterioare) - pe baza acestora construiti voi traffic flow-ul reprezentat prin liniile colorate.&lt;/P&gt;&lt;P&gt;2) Cele pentru care calculati ruta optima in mod dinamic, la cererea utilizatorului. Calculul rutei se face in functie de traficul existent, codificat prin costurile muchiilor din graf.&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;Pentru ambele categorii de masini puteti considera ca deplasarea are loc cu viteza constanta pe fiecare segment de drum (un segment este marginit de 2 noduri, fiind echivalent cu o muchie). Viteza efectiva pe acel segment depinde de traficul de pe acel segment. Aplicand aceasta idee pe masinile de la (1) obtineti simularea traficului in timp.&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Wed, 24 May 2017 11:39:52 GMT</pubDate>
      <guid>https://community.nxp.com/t5/Linux-Embedded-Challenge/project20-Cum-fac-sa-simulez-mai-multe-masini-o-data/m-p/682823#M80</guid>
      <dc:creator>andrei_trandafi</dc:creator>
      <dc:date>2017-05-24T11:39:52Z</dc:date>
    </item>
  </channel>
</rss>

