Adding flatland references #270
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
tortinator
requested changes
Apr 22, 2025
krr.bib
Outdated
Comment on lines
6588
to
6597
| @misc{chlihast23a, | ||
| title = {Scalable Rail Planning and Replanning with Soft Deadlines}, | ||
| author = {Z. Chen and J. Li and D. Harabor and P. Stuckey}, | ||
| archiveprefix = {arXiv}, | ||
| eprint = {2306.06455}, | ||
| primaryclass = {cs.RO}, | ||
| url = {https://arxiv.org/abs/2306.06455}, | ||
| year = {2023} | ||
| } | ||
|
|
Contributor
There was a problem hiding this comment.
Are you sure that all bibstyles support these fields, eg archiveprefix or eprint ... check krr.bib
krr.bib
Outdated
Comment on lines
16433
to
16442
| @misc{lascscwalichzhchmasvegivshsptanigrgamisaludabhagegnymo21a, | ||
| title = {Flatland Competition 2020: MAPF and MARL for Efficient Train Coordination on a Grid World}, | ||
| author = {F. Laurent and M. Schneider and C. Scheller and J. Watson and J. Li and Z. Chen and Yi Zheng and S. Chan and K. Makhnev and O. Svidchenko and V. Egorov and D. Ivanov and A. Shpilman and E. Spirovska and O. Tanevski and A. Nikov and R. Grunder and D. Galevski and J. Mitrovski and G. Sartoretti and Z. Luo and M. Damani and N. Bhattacharya and S. Agarwal and A. Egli and E. Nygren and S. Mohanty}, | ||
| archiveprefix = {arXiv}, | ||
| eprint = {2103.16511}, | ||
| primaryclass = {cs.AI}, | ||
| url = {https://arxiv.org/abs/2103.16511}, | ||
| year = {2021} | ||
| } | ||
|
|
krr.bib
Outdated
Comment on lines
16979
to
16992
| @article{lichzhchhastmako21a, | ||
| title = {Scalable Rail Planning and Replanning: Winning the 2020 Flatland Challenge}, | ||
| author = {J. Li and Z. Chen and Yi Zheng and S. Chan and D. Harabor and P. Stuckey and H. Ma and S. Koenig}, | ||
| abstractnote = {Multi-Agent Path Finding (MAPF) is the combinatorial problem of finding collision-free paths for multiple agents on a graph. This paper describes MAPF-based software for solving train planning and replanning problems on large-scale rail networks under uncertainty. The software recently won the 2020 Flatland Challenge, a NeurIPS competition trying to determine how to efficiently manage dense traffic on rail networks. The software incorporates many state-of-the-art MAPF or, in general, optimization technologies, such as prioritized planning, large neighborhood search, safe interval path planning, minimum communication policies, parallel computing, and simulated annealing. It can plan collision-free paths for thousands of trains within a few minutes and deliver deadlock-free actions in real-time during execution.}, | ||
| doi = {10.1609/icaps.v31i1.15994}, | ||
| journal = {Proceedings of the International Conference on Automated Planning and Scheduling}, | ||
| month = {May}, | ||
| number = {1}, | ||
| pages = {477-485}, | ||
| url = {https://ojs.aaai.org/index.php/ICAPS/article/view/15994}, | ||
| volume = {31}, | ||
| year = {2021} | ||
| } | ||
|
|
Contributor
There was a problem hiding this comment.
This is a conference, crossref with the entry in procs.bib
- drop
url(doiis there) - drop
month
krr.bib
Outdated
Comment on lines
19185
to
19194
| @misc{monylascscbhwaegeibavistsasp20a, | ||
| title = {Flatland-RL : Multi-Agent Reinforcement Learning on Trains}, | ||
| author = {S. Mohanty and E. Nygren and F. Laurent and M. Schneider and C. Scheller and N. Bhattacharya and J. Watson and A. Egli and C. Eichenberger and C. Baumberger and G. Vienken and I. Sturm and G. Sartoretti and G. Spigler}, | ||
| archiveprefix = {arXiv}, | ||
| eprint = {2012.05893}, | ||
| primaryclass = {cs.AI}, | ||
| url = {https://arxiv.org/abs/2012.05893}, | ||
| year = {2020} | ||
| } | ||
|
|
Contributor
Author
|
Thanks @tortinator ! Just made the changes. As for ryzner20a, the convention he followed is to use the @mastersthesis entry but to adjust the type field, therefore I will keep this the same. lichzhchhastmako21a has been cross-referenced with |
tortinator
requested changes
Apr 23, 2025
krr.bib
Outdated
| @@ -1,3 +1,15 @@ | |||
| @comment{@inproceedings{lichzhchhastmako21a, | |||
Contributor
There was a problem hiding this comment.
It seems that this was rejected by the checker...
krr.bib
Outdated
| abstractnote = {Multi-Agent Path Finding (MAPF) is the combinatorial problem of finding collision-free paths for multiple agents on a graph. This paper describes MAPF-based software for solving train planning and replanning problems on large-scale rail networks under uncertainty. The software recently won the 2020 Flatland Challenge, a NeurIPS competition trying to determine how to efficiently manage dense traffic on rail networks. The software incorporates many state-of-the-art MAPF or, in general, optimization technologies, such as prioritized planning, large neighborhood search, safe interval path planning, minimum communication policies, parallel computing, and simulated annealing. It can plan collision-free paths for thousands of trains within a few minutes and deliver deadlock-free actions in real-time during execution.}, | ||
| doi = {10.1609/icaps.v31i1.15994}, | ||
| crossref = {icaps21}, | ||
| number = {1}, |
Contributor
There was a problem hiding this comment.
What's this for a conference paper?
krr.bib
Outdated
| crossref = {icaps21}, | ||
| number = {1}, | ||
| pages = {477-485}, | ||
| volume = {31}, |
Contributor
There was a problem hiding this comment.
What's this for a conference paper?
Co-authored-by: Torsten Schaub <torsten@cs.uni-potsdam.de>
Co-authored-by: Torsten Schaub <torsten@cs.uni-potsdam.de>
Co-authored-by: Torsten Schaub <torsten@cs.uni-potsdam.de>
Co-authored-by: Torsten Schaub <torsten@cs.uni-potsdam.de>
Contributor
|
Hey @helloKep , just to be sure: I wait for your renewed review request 😇 |
Contributor
Author
I am ready for a review! Thank you 🫡 @tortinator |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
I've added five entries in this first push: