Дисертації з теми "SLAM (Computer program language)"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 дисертацій для дослідження на тему "SLAM (Computer program language)".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
Cornwall, Maxwell W. "MEEBS a model for multi-echelon evaluation by simulation /." Thesis, Monterey, California : Naval Postgraduate School, 1990. http://handle.dtic.mil/100.2/ADA237099.
Повний текст джерелаThesis Advisor(s): McMasters, Alan W. ; Bailey, Michael P. "June 1990." Description based on signature page as viewed on October 21, 2009. DTIC Identifier(s): Computerized simulation, logistics management. Author(s) subject terms: Multi-echelon, simulation, SLAM II, models. Includes bibliographical references (p. 142-147). Also available in print.
Kiang, Kai-Ming Mechanical & Manufacturing Engineering Faculty of Engineering UNSW. "Natural feature extraction as a front end for simultaneous localization and mapping." Awarded by:University of New South Wales. School of Mechanical and Manufacturing Engineering, 2006. http://handle.unsw.edu.au/1959.4/26960.
Повний текст джерелаCunningham, Alexander G. "Scalable online decentralized smoothing and mapping." Diss., Georgia Institute of Technology, 2014. http://hdl.handle.net/1853/51848.
Повний текст джерелаJoubert, Daniek. "Adaptive occupancy grid mapping with measurement and pose uncertainty." Thesis, Stellenbosch : Stellenbosch University, 2012. http://hdl.handle.net/10019.1/71911.
Повний текст джерелаENGLISH ABSTRACT: In this thesis we consider the problem of building a dense and consistent map of a mobile robot’s environment that is updated as the robot moves. Such maps are vital for safe and collision-free navigation. Measurements obtained from a range sensor mounted on the robot provide information on the structure of the environment, but are typically corrupted by noise. These measurements are also relative to the robot’s unknown pose (location and orientation) and, in order to combine them into a world-centric map, pose estimation is necessary at every time step. A SLAM system can be used for this task. However, since landmark measurements and robot motion are inherently noisy, the pose estimates are typically characterized by uncertainty. When building a map it is essential to deal with the uncertainties in range measurements and pose estimates in a principled manner to avoid overconfidence in the map. A literature review of robotic mapping algorithms reveals that the occupancy grid mapping algorithm is well suited for our goal. This algorithm divides the area to be mapped into a regular lattice of cells (squares for 2D maps or cubes for 3D maps) and maintains an occupancy probability for each cell. Although an inverse sensor model is often employed to incorporate measurement uncertainty into such a map, many authors merely state or depict their sensor models. We derive our model analytically and discuss ways to tailor it for sensor-specific uncertainty. One of the shortcomings of the original occupancy grid algorithm is its inability to convey uncertainty in the robot’s pose to the map. We address this problem by altering the occupancy grid update equation to include weighted samples from the pose uncertainty distribution (provided by the SLAM system). The occupancy grid algorithm has been criticized for its high memory requirements. Techniques have been proposed to represent the map as a region tree, allowing cells to have different sizes depending on the information received for them. Such an approach necessitates a set of rules for determining when a cell should be split (for higher resolution in a local region) and when groups of cells should be merged (for lower resolution). We identify some inconsistencies that can arise from existing rules, and adapt those rules so that such errors are avoided. We test our proposed adaptive occupancy grid algorithm, that incorporates both measurement and pose uncertainty, on simulated and real-world data. The results indicate that these uncertainties are included effectively, to provide a more informative map, without a loss in accuracy. Furthermore, our adaptive maps need far fewer cells than their regular counterparts, and our new set of rules for deciding when to split or merge cells significantly improves the ability of the adaptive grid map to mimic its regular counterpart.
AFRIKAANSE OPSOMMING: In hierdie tesis beskou ons die probleem om ’n digte en konsekwente kaart van ’n mobiele robot se omgewing te bou, wat opgedateer word soos die robot beweeg. Sulke kaarte is van kardinale belang vir veilige, botsingvrye navigasie. Metings verkry vanaf ’n sensor wat op die robot gemonteer is, verskaf inligting rakende die struktuur van die omgewing, maar word tipies deur ruis vervorm. Hierdie metings is ook relatief tot die robot se onbekende postuur (posisie en oriëntasie) en, om hulle saam te voeg in ’n wêreldsentriese kaart, is postuurafskatting nodig op elke tydstap. ’n SLAM stelsel kan vir hierdie doeleinde gebruik word. Aangesien landmerkmetings en die beweging van die robot inherent ruiserig is, word die postuurskattings gekarakteriseer deur onsekerheid. Met die bou van ’n kaart moet hierdie onsekerhede in afstandmetings en postuurskattings op ’n beginselvaste manier hanteer word om te verhoed dat te veel vertroue in die kaart geplaas word. ’n Literatuurstudie van karteringsalgoritmes openbaar die besettingsroosteralgoritme as geskik vir ons doel. Die algoritme verdeel die gebied wat gekarteer moet word in ’n reëlmatige rooster van selle (vierkante vir 2D kaarte of kubusse vir 3D kaarte) en onderhou ’n besettingswaarskynlikheid vir elke sel. Alhoewel ’n inverse sensormodel tipies gebruik word om metingsonsekerheid in so ’n kaart te inkorporeer, noem of wys baie outeurs slegs hulle model. Ons herlei ons model analities en beskryf maniere om sensorspesifieke metingsonsekerheid daarby in te sluit. Een van die tekortkominge van die besettingsroosteralgoritme is sy onvermoë om onsekerheid in die postuur van die robot na die kaart oor te dra. Ons spreek hierdie probleem aan deur die opdateringsvergelyking van die oorspronklike besettingsroosteralgoritme aan te pas, om geweegde monsters van die postuuronsekerheidsverdeling (verskaf deur die SLAM stelsel) in te sluit. Die besettingsroosteralgoritme word soms gekritiseer vir sy hoë verbruik van geheue. Tegnieke is voorgestel om die kaart as ’n gebiedsboom voor te stel, wat selle toelaat om verskillende groottes te hê, afhangende van die inligting wat vir hulle verkry is. So ’n benadering noodsaak ’n stel reëls wat spesifiseer wanneer ’n sel verdeel (vir ’n hoër resolusie in ’n plaaslike gebied) en wanneer ’n groep selle saamgevoeg (vir ’n laer resolusie) word. Ons identifiseer teenstrydighede wat kan voorkom as die huidige reëls gevolg word, en pas hierdie reëls aan sodat sulke foute vermy word. Ons toets ons voorgestelde aanpasbare besettingsroosteralgoritme, wat beide metings- en postuuronsekerheid insluit, op gesimuleerde en werklike data. Die resultate dui daarop dat hierdie onsekerhede op ’n effektiewe wyse na die kaart oorgedra word sonder om akkuraatheid prys te gee. Wat meer is, ons aanpasbare kaarte benodig heelwat minder selle as hul reëlmatige eweknieë. Ons nuwe stel reëls om te besluit wanneer selle verdeel of saamgevoeg word, veroorsaak ook ’n merkwaardige verbetering in die vermoë van die aanpasbare roosterkaart om sy reëlmatige eweknie na te boots.
Rimmasch, Kathryn. "A Process-Based CALL Assessment: A Comparison of Input Processing and Program Use Behavior by Activity Type." Diss., CLICK HERE for online access, 2007. http://contentdm.lib.byu.edu/ETD/image/etd2220.pdf.
Повний текст джерелаWendt, N. Rodney. "Applications of program understanding and rule-based quality assurance to Slam II simulation programs." Thesis, University of Ottawa (Canada), 1993. http://hdl.handle.net/10393/6893.
Повний текст джерелаShepherd, David. "Natural language program analysis combining natural language processing with program analysis to improve software maintenance tools /." Access to citation, abstract and download form provided by ProQuest Information and Learning Company; downloadable PDF file, 176 p, 2007. http://proquest.umi.com/pqdweb?did=1397920371&sid=6&Fmt=2&clientId=8331&RQT=309&VName=PQD.
Повний текст джерелаChou, Robert Shih-pei. "A program design language for COBOL." Thesis, Kansas State University, 1985. http://hdl.handle.net/2097/13200.
Повний текст джерелаRichardson, Joel E. "E a persistent systems implementation language /." Madison, Wis. : University of Wisconsin-Madison, Computer Sciences Dept, 1989. http://catalog.hathitrust.org/api/volumes/oclc/20839601.html.
Повний текст джерелаGordon, Christopher Todd. "A visual language for ADA program unit specifications." Thesis, This resource online, 1990. http://scholar.lib.vt.edu/theses/available/etd-06232009-063007/.
Повний текст джерелаMartin, Walter E. "Cview, a graphical program generator for the C programming language /." Online version of thesis, 1988. http://hdl.handle.net/1850/10224.
Повний текст джерелаYessenov, Kuat T. "A lightweight specification language for bounded program verification." Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/53184.
Повний текст джерелаCataloged from PDF version of thesis.
Includes bibliographical references (p. 63-64).
This thesis presents a new light-weight specification language called JForge Specification Language (JFSL) for object-oriented languages such as Java. The language is amenable to bounded verification analysis by a tool called JForge that interprets JFSL specifications, fully integrates with a mainstream development environment, and assists programmers in examining counter example traces and debugging specifications. JFSL attempts to address challenges of specification languages such as inheritance, frame conditions, dynamic dispatch, and method calls inside specifications in the context of bounded verification. A collection of verification tasks illustrates the expressiveness and conciseness of JForge specifications and demonstrates effectiveness of the bounded verification technique.
by Kuat T. Yessenov.
M.Eng.
Leoutsarakos, Nikolaos. "A context sensitive command language /." Thesis, McGill University, 1985. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=63274.
Повний текст джерелаGibson, Barbara Brunner. "Ada as a design specification language /." Online version of thesis, 1988. http://hdl.handle.net/1850/10215.
Повний текст джерелаOuren, Leslie Serine. "Integrating computer software within the Houghton Mifflin Language Arts program." CSUSB ScholarWorks, 2005. https://scholarworks.lib.csusb.edu/etd-project/2918.
Повний текст джерелаKoh, Kyu Han Seals Cheryl D. "PineHill a novel approach to computer aided language learning /." Auburn, Ala., 2007. http://hdl.handle.net/10415/1365.
Повний текст джерелаTrachsel, Anne Roberta. "L-EQUEL : an embedded query language for Franz LISP." Thesis, Kansas State University, 1985. http://hdl.handle.net/2097/9884.
Повний текст джерелаYildiz, Faruk. "Implementation of a human avatar for the MARG project in networked virtual environments." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2004. http://library.nps.navy.mil/uhtbin/hyperion/04Mar%5FYildiz.pdf.
Повний текст джерелаThesis advisor(s): Xiaoping Yun. Includes bibliographical references (p. 61-62). Also available online.
Calnan, Paul W. "EXTRACT, Extensible Transformation and Compiler Technology." Link to electronic thesis, 2003. http://www.wpi.edu/Pubs/ETD/Available/etd-0429103-152947.
Повний текст джерелаPimentel, Richard. "Direct Simulation from a Model Specification Language." DigitalCommons@USU, 1986. https://digitalcommons.usu.edu/etd/6985.
Повний текст джерелаMiller, Ruane. "A study of PostScript as a graphics programming language /." Online version of thesis, 1988. http://hdl.handle.net/1850/11483.
Повний текст джерелаChan, Chi-hown Johnny. "Implementation of computer simulation software in learning low-level computer language : a case study /." Hong Kong : University of Hong Kong, 2001. http://sunzi.lib.hku.hk/hkuto/record.jsp?B24700770.
Повний текст джерелаBull, Tim. "Software maintenance by program transformation in a wide spectrum language." Thesis, Durham University, 1994. http://etheses.dur.ac.uk/5494/.
Повний текст джерелаKenyon, John L. "CHIMP the C/C++ hybrid imperative meta-programmer /." abstract and full text PDF (free order & download UNR users only), 2008. http://0-gateway.proquest.com.innopac.library.unr.edu/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:1453647.
Повний текст джерелаNagulakonda, Vikram. "Assertion seeding development of program instrumentation through iterative formal analysis /." Morgantown, W. Va. : [West Virginia University Libraries], 1999. http://etd.wvu.edu/templates/showETD.cfm?recnum=1080.
Повний текст джерелаTitle from document title page. Document formatted into pages; contains v, 80 p. : ill. Includes abstract. Includes bibliographical references (p. 33-35).
Tollefson, Bradley A. "The J-shell command language interpreter." Virtual Press, 1985. http://liblink.bsu.edu/uhtbin/catkey/506686.
Повний текст джерелаMosca, Peter. "A study of Ada and C in concurrent programming." Instructions for remote access. Click here to access this electronic resource. Access available to Kutztown University faculty, staff, and students only, 1991. http://www.kutztown.edu/library/services/remote_access.asp.
Повний текст джерелаSource: Masters Abstracts International, Volume: 45-06, page: 3190. Abstract precedes thesis as [1] preliminary leaf. Typescript. Includes bibliographical references (leaf 54).
Motwani, Manjula H. "An Occam2 implementation of Prolog /." Online version of thesis, 1994. http://hdl.handle.net/1850/12175.
Повний текст джерелаBarrett, Kirk. "A program development system using an attribute grammar." Thesis, Kansas State University, 1985. http://hdl.handle.net/2097/9821.
Повний текст джерелаYu, Henry 1961. "HPSIMC: AHPL SIMULATOR IMPLEMENTED IN C LANGUAGE (PARSER, SOFTWARE)." Thesis, The University of Arizona, 1986. http://hdl.handle.net/10150/291313.
Повний текст джерелаWright, Madeleine. "A detailed investigation of interoperability for web services." Thesis, Rhodes University, 2006. http://hdl.handle.net/10962/d1004832.
Повний текст джерелаChow, Kent. "GPLOT : a language for plotting graphs." Thesis, McGill University, 1985. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=66062.
Повний текст джерелаFirth, Michael Anthony. "A fold/unfold transformation system for a non-strict language." Thesis, University of York, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.280416.
Повний текст джерелаLindstrom, Lowell Richard. "The implementation of a SIMULA compiler on the Kansas State University Perkin-Elmer computers." Thesis, Kansas State University, 1986. http://hdl.handle.net/2097/9934.
Повний текст джерелаParsa, Saeed. "Design and specification of a program specification language for engineering applications." Thesis, University of Salford, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.357026.
Повний текст джерелаMarsh, David William Roff. "Program refinement using a universal law : language specification and prototype tool." Thesis, University of Southampton, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.312873.
Повний текст джерелаBarrett, Mark Douglas. "Teaching language arts in third grade with HyperStudio, an interactive computer program." CSUSB ScholarWorks, 1991. https://scholarworks.lib.csusb.edu/etd-project/849.
Повний текст джерелаVorvick, Janet. "Evaluable Functions in the Godel Programming Language: Parsing and Representing Rewrite Rules." PDXScholar, 1995. https://pdxscholar.library.pdx.edu/open_access_etds/5195.
Повний текст джерелаPope, Bernard James. "A declarative debugger for Haskell /." Connect to thesis, 2006. http://eprints.unimelb.edu.au/archive/00003290.
Повний текст джерелаColeman, Jesse J. "The design, construction, and implementation of an engineering software command processor and macro compiler /." Online version of thesis, 1995. http://hdl.handle.net/1850/12219.
Повний текст джерелаWidjaja, Hendra. "Visor++ : a software visualisation tool for task-parallel object-orientated programs." Title page, abstract and contents only, 1998. http://web4.library.adelaide.edu.au/theses/09AS/09asw639.pdf.
Повний текст джерелаHaugh, J. Steven. "The design of a virtual fact base for Prolog." Master's thesis, This resource online, 1991. http://scholar.lib.vt.edu/theses/available/etd-02022010-020103/.
Повний текст джерелаGunnlaugsson, Bjorgvin. "Concurrency and sharing in prolog and in a picture editor for aldat." Thesis, McGill University, 1987. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=63864.
Повний текст джерелаDuffy, Sandra Lee. "PEDIT-- a resident structure editor for PROLOG." Thesis, Kansas State University, 1985. http://hdl.handle.net/2097/9833.
Повний текст джерелаLibrers, Joseph. "A module declaration generator." Thesis, Kansas State University, 1985. http://hdl.handle.net/2097/9861.
Повний текст джерелаLaliberté, Normand. "Design and implementation of a primary memory version of ALDAT, including recursive relations." Thesis, McGill University, 1986. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=65497.
Повний текст джерелаDodge, Nathan. "Course development for a college Java programming class." [Denver, Colo.] : Regis University, 2005. http://165.236.235.140/lib/NDodge2005.pdf.
Повний текст джерелаSchmitt, Susan M. "A critical examination of the relationship between the memory requirements of structured BASIC and unstructured BASIC." Instructions for remote access. Click here to access this electronic resource. Access available to Kutztown University faculty, staff, and students only, 1985. http://www.kutztown.edu/library/services/remote_access.asp.
Повний текст джерелаWang, Jian. "Pointer analysis in Java programs using execution path information /." View abstract or full-text, 2008. http://library.ust.hk/cgi/db/thesis.pl?CSED%202008%20WANG.
Повний текст джерела黃介亮 and Kai-leung Adam Wong. "On improving the alternation construct in occam." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1996. http://hub.hku.hk/bib/B31213741.
Повний текст джерела