[go: up one dir, main page]

Nandy et al., 2023 - Google Patents

Maze Solving Using Deep Q-Network

Nandy et al., 2023

View PDF
Document ID
3906936265481395059
Author
Nandy A
Seshathri S
Sarkar A
Publication year
Publication venue
Proceedings of the 2023 6th International Conference on Advances in Robotics

External Links

Snippet

Path planning and obstacle avoidance are crucial for enabling the autonomy of mobile robots to operate in real-world environments. Conventional algorithms are known to be computationally expensive, and they require prior knowledge of the environment. In this …
Continue reading at dl.acm.org (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N99/00—Subject matter not provided for in other groups of this subclass
    • G06N99/005—Learning machines, i.e. computer in which a programme is changed according to experience gained by the machine itself during a complete run
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computer systems utilising knowledge based models
    • G06N5/02—Knowledge representation
    • G06N5/022—Knowledge engineering, knowledge acquisition
    • G06N5/025—Extracting rules from data
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computer systems utilising knowledge based models
    • G06N5/04—Inference methods or devices
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computer systems based on biological models
    • G06N3/004—Artificial life, i.e. computers simulating life
    • G06N3/006—Artificial life, i.e. computers simulating life based on simulated virtual individual or collective life forms, e.g. single "avatar", social simulations, virtual worlds
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computer systems based on biological models
    • G06N3/02—Computer systems based on biological models using neural network models
    • G06N3/04—Architectures, e.g. interconnection topology
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computer systems based on biological models
    • G06N3/12—Computer systems based on biological models using genetic models
    • G06N3/126—Genetic algorithms, i.e. information processing using digital simulations of the genetic system
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N7/00—Computer systems based on specific mathematical models
    • G06N7/005—Probabilistic networks
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06K—RECOGNITION OF DATA; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K9/00—Methods or arrangements for reading or recognising printed or written characters or for recognising patterns, e.g. fingerprints
    • G06K9/62—Methods or arrangements for recognition using electronic means
    • G06K9/6217—Design or setup of recognition systems and techniques; Extraction of features in feature space; Clustering techniques; Blind source separation
    • G06K9/6232—Extracting features by transforming the feature space, e.g. multidimensional scaling; Mappings, e.g. subspace methods
    • G06K9/6251—Extracting features by transforming the feature space, e.g. multidimensional scaling; Mappings, e.g. subspace methods based on a criterion of topology preservation, e.g. multidimensional scaling, self-organising maps

Similar Documents

Publication Publication Date Title
Wang et al. Dreamwalker: Mental planning for continuous vision-language navigation
Van Den Berg et al. Interactive navigation of multiple agents in crowded environments
Zhai et al. Peanut: Predicting and navigating to unseen targets
Gu et al. DM-DQN: Dueling Munchausen deep Q network for robot path planning
JP7707846B2 (en) Route planning system, route planning method, roadmap construction device, model generation device, and model generation method
EP4137997B1 (en) Methods and system for goal-conditioned exploration for object goal navigation
Yang et al. Plan2vec: Unsupervised representation learning by latent plans
Singhal et al. Dynamic bayes net approach to multimodal sensor fusion
Nichols et al. Adversarial sampling-based motion planning
Davoodi et al. Feature-based interpretable reinforcement learning based on state-transition models
Islam et al. Malicious path manipulations via exploitation of representation vulnerabilities of vision-language navigation systems
Gong et al. Reinforcement learning for multi-agent formation navigation with scalability
Kruusmaa et al. Covering the path space: a casebase analysis for mobile robot path planning
De Tinguy et al. Learning dynamic cognitive map with autonomous navigation
Nandy et al. Maze Solving Using Deep Q-Network
Wang et al. Guided cooperation in hierarchical reinforcement learning via model-based rollout
Ustun et al. Controlling synthetic characters in simulations: a case for cognitive architectures and sigma
Gattu Autonomous navigation and obstacle avoidance using self-guided and self-regularized actor-critic
Rahmani et al. Planning to chronicle
Sayar et al. Curriculum learning for robot manipulation tasks with sparse reward through environment shifts
Fan et al. Avoiding lingering in learning active recognition by adversarial disturbance
Beker et al. Palmer: Perception-action loop with memory for long-horizon planning
Gode et al. Flownav: Combining flow matching and depth priors for efficient navigation
Tinguy et al. Home run: finding your way home by imagining trajectories
Venuto Robust Adversarial Inverse Reinforcement Learning with Temporally Extended Actions