Entry Kolushev:2000:MAO from lncs2000.bib
Last update: Thu May 16 02:07:42 MDT 2019
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Kolushev:2000:MAO,
author = "Fedor A. Kolushev and Alexander A. Bogdanov",
title = "Multi-agent Optimal Path Planning for Mobile Robots in
Environment with Obstacles",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1755",
pages = "503--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Feb 1 09:16:08 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1755.htm;
http://www.math.utah.edu/pub/tex/bib/lncs2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1755/17550503.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1755/17550503.pdf",
acknowledgement = ack-nhfb,
}
Related entries
- agent, Multi-,
1792(0)297,
1792(0)309,
1822(0)187,
1822(0)369,
1822(0)389,
1839(0)83,
1909(0)314,
1919(0)254,
1919(0)300,
1931(0)243,
1932(0)237,
1932(0)591,
1937(0)449,
1983(0)301,
1983(0)314,
1983(0)320,
1983(0)338
- Environment,
1765(0)125,
1765(0)314,
1792(0)202,
1799(0)210,
1800(0)194,
1800(0)218,
1800(0)285,
1800(0)314,
1800(0)552,
1800(0)816,
1822(0)389,
1834(0)303,
1839(0)133,
1839(0)252,
1839(0)262,
1839(0)272,
1839(0)324,
1839(0)454,
1839(0)464,
1839(0)484,
1839(0)657,
1839(0)661,
1849(0)363,
1892(0)189,
1892(0)380,
1892(0)403,
1903(0)147,
1905(0)297,
1907(0)130,
1908(0)5,
1908(0)168,
1908(0)233,
1908(0)258,
1908(0)322,
1931(0)29,
1931(0)49,
1931(0)171,
1934(0)192,
1983(0)314
- Mobile,
1765(0)364,
1773(0)203,
1782(0)305,
1783(0)319,
1784(0)283,
1784(0)375,
1800(0)636,
1800(0)1236,
1800(0)1296,
1818(0)58,
1818(0)123,
1818(0)150,
1818(0)158,
1853(0)403,
1853(0)512,
1861(0)300,
1877(0)504,
1905(0)266,
1931(0)1,
1931(0)17,
1931(0)29,
1931(0)49,
1931(0)67,
1931(0)95,
1931(0)103,
1931(0)129,
1931(0)171,
1931(0)205,
1931(0)215,
1931(0)219,
1961(0)215,
1974(0)81,
1975(0)164,
1977(0)130,
1983(0)344
- Multi-agent,
1792(0)297,
1792(0)309,
1822(0)187,
1822(0)369,
1822(0)389,
1839(0)83,
1909(0)314,
1919(0)254,
1919(0)300,
1931(0)243,
1932(0)237,
1932(0)591,
1937(0)449,
1983(0)301,
1983(0)314,
1983(0)320,
1983(0)338
- Obstacles,
1983(0)109
- Optimal,
1755(0)143,
1770(0)407,
1822(0)126,
1839(0)153,
1851(0)57,
1851(0)462,
1851(0)476,
1851(0)527,
1851(0)549,
1853(0)49,
1853(0)187,
1853(0)283,
1853(0)305,
1858(0)95,
1858(0)159,
1858(0)340,
1866(0)165,
1883(0)200,
1892(0)121,
1902(0)183,
1905(0)40,
1908(0)104,
1928(0)302,
1932(0)435,
1932(0)552,
1974(0)94,
1983(0)139,
2125(0)2,
2125(0)14,
2125(0)438
- path,
1800(0)301,
1849(0)1,
1849(0)127,
1853(0)61,
1858(0)64,
1858(0)351,
1902(0)183,
1908(0)104,
1949(0)208,
1961(0)119,
2125(0)287
- Planning,
1737(0)139,
1792(0)356,
1792(0)368,
1813(0)301,
1839(0)655,
1861(0)644,
1861(0)807,
1861(0)822,
1861(0)882,
1864(0)271,
1864(0)320,
1866(0)174,
1919(0)133,
1932(0)216,
1932(0)228,
1932(0)610,
1955(0)451,
2125(0)450
- Robot,
1755(0)517,
1792(0)345,
1813(0)301,
1849(0)100,
1849(0)265,
1983(0)109