Learning Social Navigation from Positive and Negative Demonstrations and Rule-Based Specifications

์ €์ž: Chanwoo Kim, Jihwan Yoon, Hyeonseong Kim, Taemoon Jeong, Changwoo Yoo, Seungbeen Lee, Soohwan Byeon, Hoon Chung, Matthew Pan, Jean Oh, Kyungjae Lee, Sungjoon Choi | ๋‚ ์งœ: 2025-10-14 | URL: https://arxiv.org/abs/2510.12215 📄 PDF


Essence

Figure 1

Fig. 1: Overview of the proposed framework. A. Reward learning: (a) density-based reward maps are constructed from

๋ณธ ๋…ผ๋ฌธ์€ ๊ธ์ •์  ๋ฐ ๋ถ€์ •์  ์‹œ์—ฐ๊ณผ ๊ทœ์น™ ๊ธฐ๋ฐ˜ ๋ช…์„ธ๋กœ๋ถ€ํ„ฐ ํ•™์Šตํ•œ ๋ฐ€๋„ ๊ธฐ๋ฐ˜ ๋ณด์ƒ์„ ๊ฒฐํ•ฉํ•˜์—ฌ ๋™์  ์ธ๊ฐ„ ํ™˜๊ฒฝ์—์„œ ์•ˆ์ „์„ฑ๊ณผ ์ ์‘์„ฑ์˜ ๊ท ํ˜•์„ ๋งž์ถ˜ ๋ชจ๋ฐ”์ผ ๋กœ๋ด‡ ๋„ค๋น„๊ฒŒ์ด์…˜ ์ •์ฑ…์„ ๊ฐœ๋ฐœํ•œ๋‹ค.

Motivation

Achievement

How

Figure 1

Fig. 1: Overview of the proposed framework. A. Reward learning: (a) density-based reward maps are constructed from

Originality

Limitation & Further Study

Evaluation

Novelty: 4/5 Technical Soundness: 3/5 Significance: 4/5 Clarity: 4/5 Overall: 4/5

์ดํ‰: ๋ณธ ๋…ผ๋ฌธ์€ ๋ฐ์ดํ„ฐ ๊ธฐ๋ฐ˜ ๋ณด์ƒ๊ณผ ๊ทœ์น™ ๊ธฐ๋ฐ˜ ์•ˆ์ „ ๋ช…์ œ์˜ ํšจ๊ณผ์ ์ธ ํ†ตํ•ฉ์„ ํ†ตํ•ด ๋™์  ์ธ๊ฐ„ ํ™˜๊ฒฝ์—์„œ์˜ ๋กœ๋ด‡ ๋„ค๋น„๊ฒŒ์ด์…˜์„ ๋‹ค๋ฃจ๋Š” ์‹ค์šฉ์ ์ด๊ณ  ์‹ ๋ขฐํ•  ์ˆ˜ ์žˆ๋Š” ํ•ด๊ฒฐ์ฑ…์„ ์ œ์‹œํ•˜๋ฉฐ, teacher-student ์ฆ๋ฅ˜ ๋ฐ ๋ถˆํ™•์‹ค์„ฑ ์ถ”์ • ๊ธฐ๋ฒ•์„ ํฌํ•จํ•œ ๋ฐฉ๋ฒ•๋ก ์  ๊ธฐ์—ฌ์™€ ํ•จ๊ป˜ ์‹ค์ œ ์ธ๊ฐ„ ์ฐธ์—ฌ์ž ์‹คํ—˜์œผ๋กœ ๊ฒ€์ฆํ•œ ์ ์—์„œ ๋†’์€ ๊ฐ€์น˜๋ฅผ ๊ฐ–๋Š”๋‹ค.

← ๋ชฉ๋ก์œผ๋กœ ๋Œ์•„๊ฐ€๊ธฐ

๐ŸŽง Audio Overview

์ด ๋…ผ๋ฌธ ๋ฆฌ๋ทฐ๋ฅผ ํŒŸ์บ์ŠคํŠธํ˜• ์˜ค๋””์˜ค๋กœ ์ƒ์„ฑํ•ฉ๋‹ˆ๋‹ค. (Gemini ยท ํ‚ค๋Š” ๋ธŒ๋ผ์šฐ์ €์—๋งŒ ์ €์žฅ ยท ์™„์„ฑ๋ณธ์€ ์ด๋ฉ”์ผ๋กœ๋„ ์ „์†ก)
โ–ธ ๊ณ ๊ธ‰: ๊ตฌ์„ฑ ๋ฐฉํ–ฅ(๋Œ€๋ณธ ์ž‘์„ฑ ์ง€์นจ) ์ง์ ‘ ์ˆ˜์ •