Vote for your favorite mineral in #MinCup25! - Sanidine vs. Hematite
It's a pair of often-overlooked classics as potassium feldspar sanidine competes with iron ore hematite.
Log InRegister
Quick Links : The Mindat ManualThe Rock H. Currier Digital LibraryMindat Newsletter [Free Download]
Home PageAbout MindatThe Mindat ManualHistory of MindatCopyright StatusWho We AreContact UsAdvertise on Mindat
Donate to MindatCorporate SponsorshipSponsor a PageSponsored PagesMindat AdvertisersAdvertise on Mindat
Learning CenterWhat is a mineral?The most common minerals on earthInformation for EducatorsMindat ArticlesThe ElementsThe Rock H. Currier Digital LibraryGeologic Time
Minerals by PropertiesMinerals by ChemistryAdvanced Locality SearchRandom MineralRandom LocalitySearch by minIDLocalities Near MeSearch ArticlesSearch GlossaryMore Search Options
Search For:
Mineral Name:
Locality Name:
Keyword(s):
 
The Mindat ManualAdd a New PhotoRate PhotosLocality Edit ReportCoordinate Completion ReportAdd Glossary Item
Mining CompaniesStatisticsUsersMineral MuseumsClubs & OrganizationsMineral Shows & EventsThe Mindat DirectoryDevice SettingsThe Mineral Quiz
Photo SearchPhoto GalleriesSearch by ColorNew Photos TodayNew Photos YesterdayMembers' Photo GalleriesPast Photo of the Day GalleryPhotography

Dudek, Gregory, Romanik, Kathleen, Whitesides, Sue (1998) Localizing a Robot with Minimum Travel. SIAM Journal on Computing, 27 (2). 583-604 doi:10.1137/s0097539794279201

Advanced
   -   Only viewable:
Reference TypeJournal (article/letter/editorial)
TitleLocalizing a Robot with Minimum Travel
JournalSIAM Journal on Computing
AuthorsDudek, GregoryAuthor
Romanik, KathleenAuthor
Whitesides, SueAuthor
Year1998 (April)Volume27
Issue2
PublisherSociety for Industrial & Applied Mathematics (SIAM)
DOIdoi:10.1137/s0097539794279201Search in ResearchGate
Generate Citation Formats
Mindat Ref. ID11240188Long-form Identifiermindat:1:5:11240188:1
GUID0
Full ReferenceDudek, Gregory, Romanik, Kathleen, Whitesides, Sue (1998) Localizing a Robot with Minimum Travel. SIAM Journal on Computing, 27 (2). 583-604 doi:10.1137/s0097539794279201
Plain TextDudek, Gregory, Romanik, Kathleen, Whitesides, Sue (1998) Localizing a Robot with Minimum Travel. SIAM Journal on Computing, 27 (2). 583-604 doi:10.1137/s0097539794279201
In(1998, April) SIAM Journal on Computing Vol. 27 (2) Society for Industrial & Applied Mathematics (SIAM)

See Also

These are possibly similar items as determined by title/reference text matching only.

Hopcroft, John, Joseph, Deborah, Whitesides, Sue (1985) On the Movement of Robot Arms in 2-Dimensional Bounded Regions. SIAM Journal on Computing, 14 (2). 315-333 doi:10.1137/0214025
Hopcroft, John, Joseph, Deborah, Whitesides, Sue (1984) Movement Problems for 2-Dimensional Linkages. SIAM Journal on Computing, 13 (3). 610-629 doi:10.1137/0213038
Bradford, Phillip G., Rawlins, Gregory J. E., Shannon, Gregory E. (1998) Efficient Matrix Chain Ordering in Polylog Time. SIAM Journal on Computing, 27 (2). 466-490 doi:10.1137/s0097539794270698
Barahona, Francisco, Tardos, éva (1989) Note on Weintraub’s Minimum-Cost Circulation Algorithm. SIAM Journal on Computing, 18 (3). 579-583 doi:10.1137/0218039
Garay, Juan A., Kutten, Shay, Peleg, David (1998) A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees. SIAM Journal on Computing, 27 (1). 302-316 doi:10.1137/s0097539794261118
Atallah, Mikhail J., Kosaraju, S. Rao (1988) Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel. SIAM Journal on Computing, 17 (5). 849-869 doi:10.1137/0217053
Agarwal, Pankaj K., Biedl, Therese, Lazard, Sylvain, Robbins, Steve, Suri, Subhash, Whitesides, Sue (2002) Curvature-Constrained Shortest Paths in a Convex Polygon. SIAM Journal on Computing, 31 (6). 1814-1851 doi:10.1137/s0097539700374550
Chazelle, Bernard (1998) A Spectral Approach to Lower Bounds with Applications to Geometric Searching. SIAM Journal on Computing, 27 (2). 545-556 doi:10.1137/s0097539794275665
Buss, Samuel R., Yianilos, Peter N. (1998) Linear and Time Minimum-Cost Matching Algorithms for Quasi-Convex Tours. SIAM Journal on Computing, 27 (1). 170-201 doi:10.1137/s0097539794267243
Raz, Ran (1998) A Parallel Repetition Theorem. SIAM Journal on Computing, 27 (3). 763-803 doi:10.1137/s0097539795280895
Dyer, Martin, Gritzmann, Peter, Hufnagel, Alexander (1998) On The Complexity of Computing Mixed Volumes. SIAM Journal on Computing, 27 (2). 356-400 doi:10.1137/s0097539794278384
 
and/or  
Mindat.org is an outreach project of the Hudson Institute of Mineralogy, a 501(c)(3) not-for-profit organization.
Copyright © mindat.org and the Hudson Institute of Mineralogy 1993-2025, except where stated. Most political location boundaries are © OpenStreetMap contributors. Mindat.org relies on the contributions of thousands of members and supporters. Founded in 2000 by Jolyon Ralph.
To cite: Ralph, J., Von Bargen, D., Martynov, P., Zhang, J., Que, X., Prabhu, A., Morrison, S. M., Li, W., Chen, W., & Ma, X. (2025). Mindat.org: The open access mineralogy database to accelerate data-intensive geoscience research. American Mineralogist, 110(6), 833–844. doi:10.2138/am-2024-9486.
Privacy Policy - Terms & Conditions - Contact Us / DMCA issues - Report a bug/vulnerability Current server date and time: September 7, 2025 06:54:54
Go to top of page