{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/a-critical-investigation-of-deep","title":"A Critical Investigation of Deep Reinforcement Learning for Navigation","arxiv_id":"1802.02274","date":"2018-02-07","proceeding":null,"authors":["Vikas Dhiman","Shurjo Banerjee","Brent Griffin","Jeffrey M. Siskind","Jason J. Corso"],"abstract":"The navigation problem is classically approached in two steps: an exploration\nstep, where map-information about the environment is gathered; and an\nexploitation step, where this information is used to navigate efficiently. Deep\nreinforcement learning (DRL) algorithms, alternatively, approach the problem of\nnavigation in an end-to-end fashion. Inspired by the classical approach, we ask\nwhether DRL algorithms are able to inherently explore, gather and exploit\nmap-information over the course of navigation. We build upon Mirowski et al.\n[2017] work and introduce a systematic suite of experiments that vary three\nparameters: the agent's starting location, the agent's target location, and the\nmaze structure. We choose evaluation metrics that explicitly measure the\nalgorithm's ability to gather and exploit map-information. Our experiments show\nthat when trained and tested on the same maps, the algorithm successfully\ngathers and exploits map-information. However, when trained and tested on\ndifferent sets of maps, the algorithm fails to transfer the ability to gather\nand exploit map-information to unseen maps. Furthermore, we find that when the\ngoal location is randomized and the map is kept static, the algorithm is able\nto gather and exploit map-information but the exploitation is far from optimal.\nWe open-source our experimental suite in the hopes that it serves as a\nframework for the comparison of future algorithms and leads to the discovery of\nrobust alternatives to classical navigation methods.","url_abs":"http://arxiv.org/abs/1802.02274v2","url_pdf":"http://arxiv.org/pdf/1802.02274v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"a-critical-investigation-of-deep","repo_url":"https://github.com/umrobotslang/does-drl-learn-to-navigate","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"deep-reinforcement-learning","task_name":"Deep Reinforcement Learning"},{"task_slug":"navigate","task_name":"Navigate"},{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"},{"task_slug":"reinforcement-learning-1","task_name":"Reinforcement Learning (RL)"},{"task_slug":"reinforcement-learning-2","task_name":"reinforcement-learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"umrobotslang/does-drl-learn-to-navigate","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"62c6c2fdf0532dc93d16dd6fb29315e2109e8962bf20afb09257bef809b9ec10","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}