{"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/socially-aware-motion-planning-with-deep","title":"Socially Aware Motion Planning with Deep Reinforcement Learning","arxiv_id":"1703.08862","date":"2017-03-26","proceeding":null,"authors":["Yu Fan Chen","Michael Everett","Miao Liu","Jonathan P. How"],"abstract":"For robotic vehicles to navigate safely and efficiently in pedestrian-rich\nenvironments, it is important to model subtle human behaviors and navigation\nrules (e.g., passing on the right). However, while instinctive to humans,\nsocially compliant navigation is still difficult to quantify due to the\nstochasticity in people's behaviors. Existing works are mostly focused on using\nfeature-matching techniques to describe and imitate human paths, but often do\nnot generalize well since the feature values can vary from person to person,\nand even run to run. This work notes that while it is challenging to directly\nspecify the details of what to do (precise mechanisms of human navigation), it\nis straightforward to specify what not to do (violations of social norms).\nSpecifically, using deep reinforcement learning, this work develops a\ntime-efficient navigation policy that respects common social norms. The\nproposed method is shown to enable fully autonomous navigation of a robotic\nvehicle moving at human walking speed in an environment with many pedestrians.","url_abs":"http://arxiv.org/abs/1703.08862v2","url_pdf":"http://arxiv.org/pdf/1703.08862v2.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":"socially-aware-motion-planning-with-deep","repo_url":"https://github.com/miaoruonan/MACA_test","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"socially-aware-motion-planning-with-deep","repo_url":"https://github.com/mit-acl/gym-collision-avoidance","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"autonomous-navigation","task_name":"Autonomous Navigation"},{"task_slug":"deep-reinforcement-learning","task_name":"Deep Reinforcement Learning"},{"task_slug":"motion-planning","task_name":"Motion Planning"},{"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":[{"method_slug":"speed","method_name":"SPEED"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1703.08862","atlas_url":"https://app.syntology.ai/?focus=1703.08862","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1703.08862"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1703.08862\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1703.08862"},"call":"get_concepts_for_paper(arxiv_id=\"1703.08862\")"}],"by_repo":[{"repo":"miaoruonan/MACA_test","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"mit-acl/gym-collision-avoidance","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1805.01956"],"harvested_for_calls":[{"arxiv_id":"1805.01956","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1805.01956"},"call":"get_harvested_code_for_paper(arxiv_id=\"1805.01956\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"d45bbee80eb414fddd4f09a7a111637268ca6d55d099daf800237e3f815c3564","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}