-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathreferences.bib
2485 lines (2293 loc) · 74.2 KB
/
references.bib
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
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
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
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
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
@string{icra = "{IEEE} International Conference on Robotics and
Automation"}
@string{iros = "{IEEE} International Conference on Intelligent Robots
and Systems"}
@string{rss = "Proceedings of Robotics: Science and Systems"}
@string{ijrr = "The International Journal of Robotics Research"}
@string{isrr = "The International Symposium on Robotics Research"}
@string{wafr = "International Workshop on the Algorithmic Foundations
of Robotics"}
@string{tro = "IEEE Transactions on Robotics"}
=== From IEEE Xplore ===
@inproceedings{aghamohammadi2011feedbackroadmaps,
author = {Agha-mohammadi, Ali-akbar and Chakravorty, Suman and
Amato, Nancy M.},
title = {FIRM: Feedback controller-based information-state roadmap -
A framework for motion planning under uncertainty},
booktitle = iros,
year = {2011},
month = sep,
pages = {4284-4291},
doi = {10.1109/IROS.2011.6095010},
issn = {2153-0858},
}
=== From IEEE Xplore ===
@inproceedings{aghamohammadi2011probcompleteness,
author = {Agha-mohammadi, Ali-akbar and Chakravorty, Suman and
Amato, Nancy M.},
title = {On the probabilistic completeness of the sampling-based
feedback motion planners in belief space},
booktitle = icra,
year = {2012},
month = may,
pages = {3983-3990},
doi = {10.1109/ICRA.2012.6225062},
issn = {1050-4729},
}
=== From dl.acm.org ===
@article{aine2016truncatedincremental,
author = {Sandip Aine and Maxim Likhachev},
title = {Truncated Incremental Search},
journal = {Artificial Intelligence},
issue_date = {May 2016},
volume = {234},
number = {C},
month = may,
year = {2016},
issn = {0004-3702},
pages = {49 -- 77},
numpages = {29},
url = {http://dx.doi.org/10.1016/j.artint.2016.01.009},
doi = {10.1016/j.artint.2016.01.009},
acmid = {2899659},
publisher = {Elsevier Science Publishers Ltd.},
address = {Essex, UK},
}
=== Created manually ===
@inproceedings{alami1994planalgs,
author = {R. Alami and J.P. Laumond and T. Sim\'{e}on},
title = {Two manipulation planning algorithms},
booktitle = {Workshop on Algorithmic Foundations of Robotics
(WAFR 1994)},
year = {1994},
}
=== Created manually ===
@inproceedings{alberts1998softwaredynamicgraph,
author = {David Alberts and Giuseppe Cattaneo and Umberto Nanni
and Christos D. Zaroliagis},
title = {A Software Library of Dynamic Graph Algorithms},
year = {1998},
booktitle = {Proceedings of Workshop on Algorithms and Experiments
(ALEX-98)},
pages = {129--136},
address = {University of Trento, Trento, Italy},
}
=== From http://www.roboticsproceedings.org/rss03/p30.html ===
@inproceedings{alterovitz2007stochasticroadmap,
author = {R. Alterovitz and T. Sim\'{e}on and K. Goldberg},
title = {The Stochastic Motion Roadmap: A Sampling Framework for
Planning with Markov Motion Uncertainty},
booktitle = rss,
year = {2007},
month = jun,
address = {Atlanta, GA, USA},
}
=== From IEEE Xplore ===
@inproceedings{arslan2013rrtsharp,
author = {O. Arslan and P. Tsiotras},
title = {Use of relaxation methods in sampling-based algorithms for
optimal motion planning},
booktitle = icra,
year = {2013},
pages = {2421-2428},
doi = {10.1109/ICRA.2013.6630906},
ISSN = {1050-4729},
month = may,
}
=== From IEEE Xplore ===
@inproceedings{bagnell2012arms,
author = {J. Andrew Bagnell and Cavalcanti, F. and Lei Cui
and Galluzzo, T. and Hebert, M. and Kazemi, M.
and Klingensmith, M. and Libby, J. and Tian Yu Liu
and Pollard, N. and Pivtoraiko, M. and Valois, J.-S.
and Zhu, R.},
title = {An integrated system for autonomous robotics manipulation},
year = {2012},
booktitle = iros,
month = oct,
pages = {2955-2962},
doi = {10.1109/IROS.2012.6385888},
issn = {2153-0858},
}
=== From sagepub (IJRR) ===
@article{barraquand1991distributedrepresentation,
author = {J\'{e}r\^{o}me Barraquand and Jean-Claude Latombe},
title = {Robot Motion Planning: A Distributed Representation
Approach},
year = {1991},
journal = ijrr,
volume = {10},
number = {6},
pages = {628-649},
doi = {10.1177/027836499101000604},
URL = {http://ijr.sagepub.com/content/10/6/628.abstract},
}
=== From rand.org ===
@techreport{beckmann1955transportation,
author = {Martin J. Beckmann and C. B. McGuire and C. B. Winsten},
title = {Studies in the Economics of Transportation},
year = {1955},
month = may,
institution = {RAND Corporation},
number = {RM-1488-PR},
address = {Santa Monica, CA, USA},
url = {http://www.rand.org/pubs/research_memoranda/RM1488.html},
}
=== Manual ===
@article{bellman1958routing,
author = {R. Bellman},
title = {On a routing problem},
journal = {Quarterly of Applied Mathematics},
year = {1958},
volume = {16},
pages = {87--90},
}
=== From RI website ===
@inproceedings{berenson2009manifolds,
author = {Dmitry Berenson and Siddhartha Srinivasa and
David Ferguson and James Kuffner},
title = {Manipulation planning on constraint manifolds},
booktitle = icra,
year = {2009},
month = may,
}
=== Manual ===
@phdthesis{berenson2011thesis,
author = {Dmitry Berenson},
title = {Constrained Manipulation Planning},
school = {Carnegie Mellon University, Robotics Institute},
month = may,
year = {2011},
number = {CMU-RI-TR-11-08},
}
=== From sagepub (IJRR) ===
@article{berenson2011tsrs,
author = {Dmitry Berenson and Siddhartha Srinivasa
and James Kuffner},
title = {Task Space Regions: A Framework for Pose-Constrained
Manipulation Planning},
journal = {The International Journal of Robotics Research},
volume = {30},
number = {12},
pages = {1435-1460},
year = {2011},
doi = {10.1177/0278364910396389},
url = {http://ijr.sagepub.com/content/30/12/1435.abstract},
eprint = {http://ijr.sagepub.com/content/30/12/1435.full.pdf+html},
}
=== Manual ===
@book{berge1965programminggamestransportation,
author = {Claude Berge and A. Ghouila-Houri},
title = {Programming, Games and Transportation Networks},
publisher = {Methuen},
address = {London, NY, USA},
year = {1965},
}
=== From IEEE Xplore ===
@article{bettini2004fixtures,
author = {Bettini, A. and Marayong, P. and Lang, S.
and Okamura, A.M. and Hager, G.D.},
title = {Vision-assisted control for manipulation using virtual
fixtures},
journal = tro,
year = {2004},
month = dec,
volume = {20},
number = {6},
pages = {953-966},
doi = {10.1109/TRO.2004.829483},
issn = {1552-3098},
}
=== From IEEE Xplore ===
@inproceedings{bhatia2010temporalgoals,
author = {Bhatia, A and Kavraki, L.E. and Vardi, M.Y.},
booktitle = icra,
title = {Sampling-based motion planning with temporal goals},
year = {2010},
month = may,
pages = {2689-2696},
doi = {10.1109/ROBOT.2010.5509503},
issn = {1050-4729},
}
=== From IEEE Xplore ===
@article{bhatia2011complexgoals,
author = {Bhatia, A. and Maly, M.R. and Kavraki, L.E.
and Vardi, M.Y.},
journal = {Robotics Automation Magazine, IEEE},
title = {Motion Planning with Complex Goals},
year = {2011},
month = sep,
volume = {18},
number = {3},
pages = {55-64},
doi = {10.1109/MRA.2011.942115},
issn = {1070-9932},
}
=== From IEEE Xplore ===
@inproceedings{bohlin2000lazyprm,
author = {Bohlin, R. and Kavraki, E.E.},
title = {Path planning using {L}azy {PRM}},
booktitle = icra,
year = {2000},
volume = {1},
pages = {521-528 vol.1},
doi = {10.1109/ROBOT.2000.844107},
issn = {1050-4729},
}
=== From IEEE Xplore ===
@inproceedings{boor1999prmgaussiansampling,
author = {V. Boor and M. H. Overmars and A. F. van der Stappen},
title = {The Gaussian Sampling Strategy for Probabilistic Roadmap
Planners},
year = {1999},
booktitle = icra,
volume = {2},
pages = {1018-1023 vol.2},
doi = {10.1109/ROBOT.1999.772447},
issn = {1050-4729},
}
=== From Springer ===
@incollection{brandesetal2002graphml,
author = {Ulrik Brandes and Markus Eiglsperger and Ivan Herman
and Michael Himsolt and M. Scott Marshall},
editor = {Petra Mutzel and Michael J{\"u}nger and Sebastian Leipert},
title = {{GraphML} Progress Report: Structural Layer Proposal},
booktitle = {9th Int. Symp. Graph Drawing,
Vienna, Austria, September 23--26 2001, Revised Papers},
year = {2002},
month = feb,
publisher = {Springer},
address = {Berlin, Heidelberg},
pages = {501--512},
isbn = {978-3-540-45848-7},
doi = {10.1007/3-540-45848-4_59},
note = {Lecture Notes in Computer Science, Volume 2265},
}
@unpublished{branicky2002detvsprobroadmaps,
author = {Michael S. Branicky and Steven M. LaValle and Kari Olson
and Libo Yang},
title = {Deterministic vs. Probabalistic Roadmaps},
note = {Unpublished},
year = {2002},
}
=== Manual ===
@inproceedings{burns2013bugsy,
title = {Heuristic Search When Time Matters},
author = {Burns, Ethan and Ruml, Wheeler and Do, Minh B.},
booktitle = {International Joint Conference
on Artificial Intelligence},
pages = {697--740},
year = {2013},
volume = {47},
doi = {10.1613/jair.4047},
}
=== From sagepub (IJRR) ===
@article{cambon2009hybrid,
author = {St\'{e}phane Cambon and Racid Alami and Fabien Gravot},
title = {A hybrid approach to intricate motion, manipulation and
task planning},
journal = ijrr,
volume = {28},
number = {1},
pages = {104-126},
year = {2009},
doi = {10.1177/0278364908097884},
url = {http://ijr.sagepub.com/content/28/1/104.abstract},
}
=== From dl.acm.org ===
@book{canny1988complexitymotionplanning,
author = {John F. Canny},
title = {The Complexity of Robot Motion Planning},
year = {1988},
isbn = {0-262-03136-1},
publisher = {MIT Press},
address = {Cambridge, MA, USA},
}
=== From dl.acm.org ===
@article{champeauxsint1977bhffa,
author = {Dennis de Champeaux and Lenie Sint},
title = {An Improved Bidirectional Heuristic Search Algorithm},
journal = {J. ACM},
issue_date = {April 1977},
volume = {24},
number = {2},
month = apr,
year = {1977},
issn = {0004-5411},
pages = {177--191},
numpages = {15},
url = {http://doi.acm.org/10.1145/322003.322004},
doi = {10.1145/322003.322004},
acmid = {322004},
publisher = {ACM},
address = {New York, NY, USA},
}
=== From dl.acm.org ===
@article{champeaux1983biheuragain,
author = {Dennis de Champeaux},
title = {Bidirectional Heuristic Search Again},
journal = {J. ACM},
volume = {30},
number = {1},
month = jan,
year = {1983},
issn = {0004-5411},
pages = {22--32},
numpages = {11},
url = {http://doi.acm.org/10.1145/322358.322360},
doi = {10.1145/322358.322360},
acmid = {322360},
publisher = {ACM},
address = {New York, NY, USA},
}
=== From RI website ===
@inproceedings{chang2010pregrasp,
author = {Lillian Y. Chang and Siddhartha Srinivasa
and Nancy Pollard},
title = {Planning pre-grasp manipulation for transport tasks},
booktitle = icra,
month = may,
year = {2010},
}
=== Manual ===
@unpublished{cheng2004rescomplete,
author = {Peng Cheng and Steven M. LaValle},
title = {Resolution completeness for sampling-based motion planning
with differential constraints},
year = {2004},
institution = {Dept. of Computer Science, University of Illinois},
url = {http://msl.cs.uiuc.edu/~pcheng1/papers/rc04.pdf},
note = {Unpublished},
}
=== From RI website ===
@book{choset2005robotmotion,
author = {Howie Choset and Kevin M. Lynch and Seth Hutchinson
and George A Kantor and Wolfram Burgard and Lydia E. Kavraki
and Sebastian Thrun},
title = {Principles of Robot Motion:
Theory, Algorithms, and Implementations},
booktitle = {Principles of Robot Motion:
Theory, Algorithms, and Implementations},
publisher = {MIT Press},
address = {Cambridge, MA},
month = jun,
year = {2005},
notes = {ISBN 0-262-03327-5},
}
=== Manual ===
@inproceedings{choudhury2016pomp,
author = {Shushman Choudhury and Christopher Dellin
and Siddhartha Srinivasa},
title = {Pareto-Optimal Search Over Configuration Space Beliefs
for Anytime Motion Planning},
year = {2016},
booktitle = iros,
}
@inproceedings{cohen2014narms,
author = {Benjamin Cohen and Mike Phillips and Maxim Likhachev},
title = {Planning Single-arm Manipulations with n-Arm Robots},
booktitle = rss,
year = {2014},
address = {Berkeley, USA},
month = jul,
}
=== From rand.org ===
@techreport{dantzig1963linearprogramming,
author = {George Bernard Dantzig},
title = {Linear Programming and Extensions},
year = {1963},
month = aug,
institution = {RAND Corporation},
number = {R-366-PR},
address = {Santa Monica, CA, USA},
url = {http://www.rand.org/pubs/reports/R366.html},
}
=== From Springer website ===
@incollection{debus2001cooperative,
author = {Debus, Thomas and Stoll, Jeffrey and Howe, Robert D.
and Dupont, Pierre},
title = {Cooperative Human and Machine Perception in Teleoperated
Assembly},
booktitle = {Experimental Robotics VII},
year = {2001},
isbn = {978-3-540-42104-7},
volume = {271},
series = {Lecture Notes in Control and Information Sciences},
editor = {Rus, Daniela and Singh, Sanjiv},
doi = {10.1007/3-540-45118-8_6},
url = {http://dx.doi.org/10.1007/3-540-45118-8_6},
publisher = {Springer Berlin Heidelberg},
pages = {51-60},
language = {English},
}
@techreport{dechter1984bfsastaropt,
author = {Rina Dechter and Judea Pearl},
title = {Generalized Best-First Search Strategies and the
Optimality of {A*}},
institution = {Cognitive Systems Laboratory, UCLA},
address = {Los Angeles, CA, USA},
year = {1984},
month = jun,
}
=== From RI website ===
@inproceedings{dellin2014drc,
author = {Christopher Dellin and Kyle Strabala
and Galen Clark Haynes and David Stager
and Siddhartha Srinivasa},
title = {Guided Manipulation Planning at the
{DARPA Robotics Challenge} Trials},
booktitle = {International Symposium on Experimental Robotics},
month = jun,
year = {2014},
}
=== Manual (for now) ===
@inproceedings{dellin2015cmr,
author = {Christopher Dellin and Siddhartha Srinivasa},
booktitle = icra,
title = {A General Technique for Fast Comprehensive
Multi-Root Planning on Graphs by Coloring Vertices and
Deferring Edges},
year = {2015},
}
=== Manual (for now) ===
@inproceedings{dellin2015multiset,
author = {Christopher Dellin and Siddhartha Srinivasa},
title = {Reduce, Reuse, Recycle:
Exploiting {C-space} Structure in Similar Problems
with Multi-Set Planning},
booktitle = rss,
year = {2015, in submission},
}
=== Manual ===
@misc{demetrescuetal2006dimacs9,
author = {Camil Demetrescu and Andrew V. Goldberg
and David S. Johnson},
title = {9th {DIMACS} Implementation Challenge: Shortest Paths},
year = 2006,
howpublished = "\url{http://www.dis.uniroma1.it/challenge9/}",
note = {[Online; accessed 2016-May-22]},
}
=== From dl.acm.org ===
@incollection{demetrescu2010dynamic,
author = {Demetrescu, Camil and Eppstein, David and Galil, Zvi
and Italiano, Giuseppe F.},
title = {Dynamic Graph Algorithms},
booktitle = {Algorithms and Theory of Computation Handbook},
editor = {Atallah, Mikhail J. and Blanton, Marina},
year = {2010},
isbn = {978-1-58488-822-2},
pages = {9--9},
numpages = {1},
url = {http://dl.acm.org/citation.cfm?id=1882757.1882766},
acmid = {1882766},
publisher = {Chapman \& Hall/CRC},
}
=== From RI website ===
@inproceedings{diankov2008bispace,
author = {Rosen Diankov and Nathan Ratliff and David Ferguson and
Siddhartha Srinivasa and James Kuffner},
title = {BiSpace Planning: Concurrent Multi-Space Exploration},
booktitle = rss,
month = jun,
year = {2008},
}
=== From openrave.org ===
@phdthesis{diankov2010openrave,
author = {Rosen Diankov},
title = {Automated Construction of Robotic Manipulation Programs},
school = {Robotics Institute, Carnegie Mellon University},
month = sep,
year = {2010},
note = {CMU-RI-TR-10-29},
url = {http://www.programmingvision.com/rosen_diankov_thesis.pdf},
}
=== From citeseer ===
@article{dijkstra1959anote,
author = {E. W. Dijkstra},
title = {A Note on Two Problems in Connexion with Graphs},
journal = {Numerishe Mathematik},
year = {1959},
volume = {1},
number = {1},
pages = {269--271},
}
=== From RI website ===
@inproceedings{dogar2011pushgrasping,
author = {Mehmet Dogar and Siddhartha Srinivasa},
editor = {Hugh Durrant-Whyte, Nick Roy and Pieter Abbeel},
title = {A Framework for Push-grasping in Clutter},
booktitle = rss,
publisher = {MIT Press},
month = jul,
year = {2011},
}
=== Manual ===
@techreport{doran1966doubletree,
author = {J. E. Doran},
title = {Doubletree Searching and the Graph Traverser},
year = {1966},
month = dec,
institution = {Department of Machine Intelligence and Perception,
University of Edingurgh},
number = {EPU-R-22},
}
=== From jstor.org ===
@article{doran1966graphtraverser,
author = {J. E. Doran and D. Michie},
title = {Experiments with the Graph Traverser Program},
year = {1966},
journal = {Proceedings of the Royal Society of London.
Series A, Mathematical and Physical Sciences},
number = {1437},
pages = {235-259},
publisher = {The Royal Society},
volume = {294},
issn = {00804630},
url = {http://www.jstor.org/stable/2415467},
}
=== From IEEE Xplore ===
@inproceedings{dragan2011goalsets,
author = {Anca Draga and Nathan Ratliff and Siddhartha Srinivasa},
booktitle = icra,
title = {Manipulation planning with goal sets using constrained
trajectory optimization},
year = {2011},
month = may,
pages = {4582-4588},
doi = {10.1109/ICRA.2011.5980538},
issn = {1050-4729},
}
=== From informs.org ===
@article{dreyfus1969appraisalsp,
author = {Stuart E. Dreyfus},
title = {An Appraisal of Some Shortest-Path Algorithms},
journal = {Operations Research},
volume = {17},
number = {3},
pages = {395-412},
year = {1969},
doi = {10.1287/opre.17.3.395},
url = {http://dx.doi.org/10.1287/opre.17.3.395},
}
=== From http://www.sciencedirect.com/science/article/pii/S000437020900068X ===
@article{ebendt2009weightedastarunified,
author = {R{\"u}diger Ebendt and Rolf Drechsler},
title = {Weighted A* search -- unifying view and application},
journal = {Artificial Intelligence},
year = {2009},
volume = {173},
number = {14},
pages = {1310--1342},
issn = {0004-3702},
doi = {http://dx.doi.org/10.1016/j.artint.2009.06.004},
url = {http://www.sciencedirect.com/science/article/pii/S000437020900068X},
}
=== Manual ===
@incollection{eppstein1999dynamic,
author = {Eppstein, D and Galil, Z and Italiano, GF},
title = {Dynamic graph algorithms},
booktitle = {Algorithms and Theory of Computation Handbook, chapter 8},
year = {1999},
publisher = {CRC Press},
}
=== From IEEE Xplore ===
@inproceedings{erdmann1986multiplemoving,
author = {Erdmann, M. and Lozano-Perez, T.},
title = {On multiple moving objects},
booktitle = icra,
year = {1986},
month = apr,
volume = {3},
pages = {1419 - 1424},
doi = {10.1109/ROBOT.1986.1087401},
}
=== From http://uai.sis.pitt.edu/displayArticleDetails.jsp ===
=== mmnu=2&smnu=2&article_id=2100 ===
@inproceedings{erez2010scalablepomdp,
author = {Tom Erez and William Smart},
title = {A Scalable Method for Solving High-Dimensional Continuous
POMDPs Using Local Approximation},
booktitle = {Proceedings of the Twenty-Sixth Conference Annual
Conference on Uncertainty in Artificial Intelligence (UAI-10)},
publisher = {AUAI Press},
address = {Corvallis, Oregon},
year = {2010},
pages = {160--167},
}
=== From IEEE Xplore ===
@inproceedings{faverjon1984octree,
author = {B. Faverjon},
title = {Obstacle avoidance using an octree in the configuration
space of a manipulator},
booktitle = icra,
year = {1984},
month = mar,
volume = {1},
pages = {504-512},
doi = {10.1109/ROBOT.1984.1087218},
}
=== From citeseerx ===
@inproceedings{felner2012epastar,
author = {Ariel Felner and Nathan Sturtevant and Meir Goldenberg
and Roni Stern and Tal Beja and Jonathan Schaeffer
and Robert C. Holte},
title = {Partial Expansion A* with Selective Node Generation},
booktitle = {In Proceedings of AAAI},
year = {2012},
}
=== Manual ===
@techreport{ferbach1993penalty,
author = {Pierre Ferbach and J{\'e}r{\^o}me Barraquand},
title = {A penalty function method for constrained motion planning},
institution = {Digital Equipment Corporation Paris Research
Laboratory},
year = {1993},
month = sep,
url = {http://www.hpl.hp.com/techreports/Compaq-DEC/PRL-RR-34.pdf},
}
=== From IEEE Xplore ===
@inproceedings{ferguson2006drrt,
author = {Ferguson, Dave and Kalra, N. and Stentz, A.},
booktitle = icra,
title = {Replanning with {RRT}s},
year = {2006},
month = may,
pages = {1243-1248},
doi = {10.1109/ROBOT.2006.1641879},
issn = {1050-4729},
}
=== From Springer website ===
@inbook{ferguson2007fielddstar,
author = {Dave Ferguson and Anthony Stentz},
title = {Field {D}*: An Interpolation-Based Path Planner and
Replanner},
booktitle = {Robotics Research: Results of the 12th International
Symposium ISRR},
year = {2007},
publisher = {Springer},
address = {Berlin, Heidelberg},
pages = {239 -- 253},
isbn = {978-3-540-48113-3},
doi = {10.1007/978-3-540-48113-3_22},
}
=== From http://www.sciencedirect.com ===
@article{fikes1971strips,
author = {Richard E. Fikes and Nils J. Nilsson},
title = {Strips: A new approach to the application of theorem
proving to problem solving},
journal = {Artificial Intelligence},
volume = {2},
number = {3-4},
year = {1971},
pages = {189-208},
doi = {10.1016/0004-3702(71)90010-5},
}
=== From rand.org ===
@techreport{ford1955networkflowtheory,
author = {L. R. Ford},
title = {Network Flow Theory},
year = {1956},
month = aug,
institution = {RAND Corporation},
number = {P-923},
address = {Santa Monica, CA, USA},
url = {http://www.rand.org/pubs/papers/P923.html},
}
=== From http://dl.acm.org/citation.cfm?id=313926 ===
@inproceedings{frigioni1996dynamicsinglesource,
author = {Frigioni, Daniele and Marchetti-Spaccamela, Alberto
and Nanni, Umberto},
title = {Fully Dynamic Output Bounded Single Source Shortest Path
Problem},
booktitle = {Proceedings of the Seventh Annual ACM-SIAM Symposium
on Discrete Algorithms},
series = {SODA '96},
year = {1996},
isbn = {0-89871-366-8},
location = {Atlanta, Georgia, USA},
pages = {212--221},
numpages = {10},
url = {http://dl.acm.org/citation.cfm?id=313852.313926},
acmid = {313926},
publisher = {Society for Industrial and Applied Mathematics},
address = {Philadelphia, PA, USA},
}
=== From http://dl.acm.org/citation.cfm?id=338900 ===
@article{frigioni2000dynamicsp,
author = {Frigioni, Daniele and Marchetti-Spaccamela, Alberto
and Nanni, Umberto},
title = {Fully Dynamic Algorithms for Maintaining Shortest Paths
Trees},
journal = {J. Algorithms},
issue_date = {Feb. 2000},
volume = {34},
number = {2},
month = feb,
year = {2000},
issn = {0196-6774},
pages = {251--281},
numpages = {31},
url = {http://dx.doi.org/10.1006/jagm.1999.1048},
doi = {10.1006/jagm.1999.1048},
publisher = {Academic Press, Inc.},
address = {Duluth, MN, USA},
}
=== Manual ===
@techreport{fulkerson1953lbap,
author = {Fulkerson, R. and Glicksberg, I. and Gross, O.},
title = {A production line assignment problem},
institution = {The RAND Corporation},
year = {1953},
number = {RM-1102},
}
=== From IEEE Xplore ===
@inproceedings{gammell2014informedrrtstar,
author = {Jonathan Gammell and Siddhartha Srinivasa
and Timothy Barfoot},
title = {Informed {RRT}*: Optimal sampling-based path planning
focused via direct sampling of an admissible ellipsoidal
heuristic},
year = {2014},
month = sep,
booktitle = iros,
pages = {2997 -- 3004},
doi = {10.1109/IROS.2014.6942976},
ISSN = {2153-0858},
}
=== Manual ===
@inproceedings{gammell2015bitstar,
author = {Jonathan Gammell and Siddhartha Srinivasa
and Timothy D. Barfoot},
title = {Batch Informed Trees ({BIT*}): Sampling-based Optimal
Planning via the Heuristically Guided Search of Implicit
Random Geometric Graphs},
booktitle = icra,
year = {2015},
month = may,
}
=== Manual, from author's website ===
@inproceedings{garrett2014ffrob,
author = {Caelan Reed Garrett and Tom\'{a}s Lozano-P\'{e}rez and
Leslie Pack Kaelbling},
title = {{FFRob}: An efficient heuristic for task and motion
planning},
booktitle = wafr,
year = {2014},
url = {http://lis.csail.mit.edu/pubs/garrett-wafr14.pdf},
}
=== From IEEE Xplore ===
@inproceedings{gayle2007lazyreconfigforest,
author = {Gayle, Russell and Klingler, K.R. and Xavier, P.G.},
booktitle = icra,
title = {Lazy Reconfiguration Forest ({LRF}) - An Approach for
Motion Planning with Multiple Tasks in Dynamic Environments},
year = {2007},
month = apr,
pages = {1316-1323},
doi = {10.1109/ROBOT.2007.363167},
issn = {1050-4729},
}
=== Manual ===
@inproceedings{geraerts2002prmcomparison,
author = {R. Geraerts and M. Overmars},
title = {A comparative study of probabilistic roadmap planners},
booktitle = {Proc. of the International Workshop on Algorithmic
Foundations of Robotics (WAFR)},
year = {2002},
}
=== From http://www.aaai.org/ocs/index.php/SOCS/SOCS11/paper/view/4037/0 ===
@inproceedings{gochevetal2011adaptivedim,
author = {Kalin Gochev and Benjamin Cohen and Jonathan Butzke
and Alla Safonova and Maxim Likhachev},
title = {Path Planning with Adaptive Dimensionality},
year = {2011},
booktitle = {Fourth Annual Symposium on Combinatorial Search},
}
=== From http://www.sciencedirect.com ===
=== see https://archive.org/details/humanfactorsinte00benn ===
@article{goertz1963radioactive,
author = {Goertz, R. C.},
title = {Manipulators Used for Handling Radioactive Materials},
booktitle = {Human Factors in Technology},
chapter = {27},
editor = {E. M. Bennet},
publisher = {McGraw-Hill},
year = {1963},
}
=== From http://research.microsoft.com ===
@inproceedings{goldberg2005spexternalmemory,
author = {A. V. Goldberg and R. Werneck},
title = {Computing Point-to-Point Shortest Paths from External
Memory},
booktitle = {SIAM Workshop on Algorithms Engineering and
Experimentation (ALENEX '05)},
year = {2005},
address = {Vancouver, Canada},
url = {http://research.microsoft.com/apps/pubs/default.aspx?id=64510},
}
@incollection{goldberg2007pointtopoint,
author = {Goldberg, Andrew V.},
title = {Point-to-Point Shortest Path Algorithms with
Preprocessing},
editor = {van Leeuwen, Jan and Italiano, Giuseppe F.
and van der Hoek, Wiebe and Meinel, Christoph and Sack, Harald
and Pl{\'a}{\v{s}}il, Franti{\v{s}}ek},
booktitle = {SOFSEM 2007: Theory and Practice of Computer Science:
33rd Conference on Current Trends in Theory and Practice of
Computer Science, Harrachov, Czech Republic,
January 20-26, 2007. Proceedings},
year = {2007},
publisher = {Springer},
address = {Berlin, Heidelberg},
pages = {88--102},
isbn = {978-3-540-69507-3},
doi = {10.1007/978-3-540-69507-3_6},
url = {http://dx.doi.org/10.1007/978-3-540-69507-3_6},
}
=== Manual ===
@inproceedings{goldenberg2013epeastar,
author = {Meir Goldenberg and Ariel Felner and Nathan Sturtevant and
Robert C. Holte and Jonathan Schaeffer},
title = {Optimal-Generation Variants of EPEA*},
booktitle = {Sixth Annual Symposium on Combinatorial Search (SoCS)},
year = {2013},
url = {http://www.cs.du.edu/~sturtevant/papers/epea-opt.pdf},
}
=== From Springer website ===
@incollection{gravot2005asymov,
author = {Fabien Gravot and St\'{e}phane Cambon and Rachid Alami},
title = {{aSyMov}: A Planner That Deals with Intricate Symbolic and
Geometric Problems},
year = {2005},
isbn = {978-3-540-23214-8},
booktitle = isrr,
volume = {15},
series = {Springer Tracts in Advanced Robotics},
editor = {Dario, Paolo and Chatila, Raja},
doi = {10.1007/11008941_11},
url = {http://dx.doi.org/10.1007/11008941\_11},
publisher = {Springer},
address = {Berlin, Heidelberg},
pages = {100-110},
language = {English},
}
=== From IEEE Xplore ===
@article{hart1968astar,
author = {Hart, P.E. and Nilsson, N.J. and Raphael, B.},
journal = {IEEE Transactions on Systems Science and Cybernetics},
title = {A Formal Basis for the Heuristic Determination of Minimum
Cost Paths},
year = {1968},
month = jul,
volume = {4},
number = {2},
pages = {100-107},
doi = {10.1109/TSSC.1968.300136},
issn = {0536-1567},
}
=== From sagepub (IJRR) ===
@article{hauser2010multi,
author = {Hauser, Kris and Latombe, Jean-Claude},
title = {Multi-modal motion planning in non-expansive spaces},
journal = {The International Journal of Robotics Research},
volume = {29},
number = {7},
pages = {897-915},
year = {2010},
doi = {10.1177/0278364909352098},
url = {http://ijr.sagepub.com/content/29/7/897.abstract},
eprint = {http://ijr.sagepub.com/content/29/7/897.full.pdf+html},
}
=== From IEEE Xplore ===
@inproceedings{hauser2010smoothing,
author = {Hauser, K. and Ng-Thow-Hing, V.},
booktitle = icra,
title = {Fast smoothing of manipulator trajectories using optimal
bounded-acceleration shortcuts},
year = {2010},
month = may,
pages = {2493-2498},
doi = {10.1109/ROBOT.2010.5509683},
issn = {1050-4729},
}
=== From sagepub (IJRR) ===
@article{hauser2011randommmp,
author = {Hauser, Kris and Ng-Thow-Hing, Victor},
title = {Randomized multi-modal motion planning for a humanoid robot
manipulation task},
journal = {The International Journal of Robotics Research},
volume = {30},
number = {6},
pages = {678-698},
year = {2011},