<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
		<id>https://www.scipedia.com/wd/index.php?action=history&amp;feed=atom&amp;title=Jindal_et_al_2018a</id>
		<title>Jindal et al 2018a - Revision history</title>
		<link rel="self" type="application/atom+xml" href="https://www.scipedia.com/wd/index.php?action=history&amp;feed=atom&amp;title=Jindal_et_al_2018a"/>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Jindal_et_al_2018a&amp;action=history"/>
		<updated>2026-08-26T16:48:10Z</updated>
		<subtitle>Revision history for this page on the wiki</subtitle>
		<generator>MediaWiki 1.27.0-wmf.10</generator>

	<entry>
		<id>https://www.scipedia.com/wd/index.php?title=Jindal_et_al_2018a&amp;diff=208245&amp;oldid=prev</id>
		<title>Scipediacontent: Scipediacontent moved page Draft Content 289201132 to Jindal et al 2018a</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Jindal_et_al_2018a&amp;diff=208245&amp;oldid=prev"/>
				<updated>2021-02-03T19:43:21Z</updated>
		
		<summary type="html">&lt;p&gt;Scipediacontent moved page &lt;a href=&quot;/public/Draft_Content_289201132&quot; class=&quot;mw-redirect&quot; title=&quot;Draft Content 289201132&quot;&gt;Draft Content 289201132&lt;/a&gt; to &lt;a href=&quot;/public/Jindal_et_al_2018a&quot; title=&quot;Jindal et al 2018a&quot;&gt;Jindal et al 2018a&lt;/a&gt;&lt;/p&gt;
&lt;table class=&quot;diff diff-contentalign-left&quot; data-mw=&quot;interface&quot;&gt;
				&lt;tr style='vertical-align: top;' lang='en'&gt;
				&lt;td colspan='1' style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;← Older revision&lt;/td&gt;
				&lt;td colspan='1' style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;Revision as of 19:43, 3 February 2021&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan='2' style='text-align: center;' lang='en'&gt;&lt;div class=&quot;mw-diff-empty&quot;&gt;(No difference)&lt;/div&gt;
&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	<entry>
		<id>https://www.scipedia.com/wd/index.php?title=Jindal_et_al_2018a&amp;diff=208244&amp;oldid=prev</id>
		<title>Scipediacontent: Created page with &quot; == Abstract ==  In this paper, we develop a reinforcement learning (RL) based system to learn an effective policy for carpooling that maximizes transportation efficiency so t...&quot;</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Jindal_et_al_2018a&amp;diff=208244&amp;oldid=prev"/>
				<updated>2021-02-03T19:43:17Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot; == Abstract ==  In this paper, we develop a reinforcement learning (RL) based system to learn an effective policy for carpooling that maximizes transportation efficiency so t...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;&lt;br /&gt;
== Abstract ==&lt;br /&gt;
&lt;br /&gt;
In this paper, we develop a reinforcement learning (RL) based system to learn an effective policy for carpooling that maximizes transportation efficiency so that fewer cars are required to fulfill the given amount of trip demand. For this purpose, first, we develop a deep neural network model, called ST-NN (Spatio-Temporal Neural Network), to predict taxi trip time from the raw GPS trip data. Secondly, we develop a carpooling simulation environment for RL training, with the output of ST-NN and using the NYC taxi trip dataset. In order to maximize transportation efficiency and minimize traffic congestion, we choose the effective distance covered by the driver on a carpool trip as the reward. Therefore, the more effective distance a driver achieves over a trip (i.e. to satisfy more trip demand) the higher the efficiency and the less will be the traffic congestion. We compared the performance of RL learned policy to a fixed policy (which always accepts carpool) as a baseline and obtained promising results that are interpretable and demonstrate the advantage of our RL approach. We also compare the performance of ST-NN to that of state-of-the-art travel time estimation methods and observe that ST-NN significantly improves the prediction performance and is more robust to outliers.&lt;br /&gt;
&lt;br /&gt;
Comment: Accepted at IEEE International Conference on Big Data 2018. arXiv admin note: text overlap with arXiv:1710.04350&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Original document ==&lt;br /&gt;
&lt;br /&gt;
The different versions of the original document can be found in:&lt;br /&gt;
&lt;br /&gt;
* [http://arxiv.org/abs/1811.04345 http://arxiv.org/abs/1811.04345]&lt;br /&gt;
&lt;br /&gt;
* [http://arxiv.org/pdf/1811.04345 http://arxiv.org/pdf/1811.04345]&lt;br /&gt;
&lt;br /&gt;
* [http://xplorestaging.ieee.org/ielx7/8610059/8621858/08622481.pdf?arnumber=8622481 http://xplorestaging.ieee.org/ielx7/8610059/8621858/08622481.pdf?arnumber=8622481],&lt;br /&gt;
: [http://dx.doi.org/10.1109/bigdata.2018.8622481 http://dx.doi.org/10.1109/bigdata.2018.8622481]&lt;br /&gt;
&lt;br /&gt;
* [https://dblp.uni-trier.de/db/journals/corr/corr1811.html#abs-1811-04345 https://dblp.uni-trier.de/db/journals/corr/corr1811.html#abs-1811-04345],&lt;br /&gt;
: [https://academic.microsoft.com/#/detail/2899703365 https://academic.microsoft.com/#/detail/2899703365]&lt;/div&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	</feed>