Using Contextual Information for Sentence-level Morpheme Segmentation

Recent advancements in morpheme segmentation primarily emphasize word-level segmentation, often neglecting the contextual relevance within the sentence. In this study, we redefine the morpheme segmentation task as a sequence-to-sequence problem, treating the entire sentence as input rather than isolating individual words. Our findings reveal that the multilingual model consistently exhibits superior performance compared to monolingual counterparts. While our model did not surpass the performance of the current state-of-the-art, it demonstrated comparable efficacy with high-resource languages while revealing limitations in low-resource language scenarios.

Data-Efficient Policy Selection for Navigation in Partial Maps via Subgoal-Based Abstraction

We present a novel approach for fast and reliable policy selection for navigation in partial maps. Leveraging the recent learning-augmented model-based Learning over Subgoals Planning (LSP) abstraction to plan, our robot reuses data collected during navigation to evaluate how well other alternative policies could have performed via a procedure we call offline alt-policy replay. Costs from offline alt-policy replay constrain policy selection among the LSP-based policies during deployment, allowing for improvements in convergence speed, cumulative regret and average navigation cost. With only limited prior knowledge about the nature of unseen environments, we achieve at least 67% and as much as 96% improvements on cumulative regret over the baseline bandit approach in our experiments in simulated maze and office-like environments.

Motion Primitives based Path Planning with Rapidly-exploring Random Tree

We present an approach that generates kinodynamically feasible paths for robots using Rapidly-exploring Random Tree (RRT). We leverage motion primitives as a way to capture the dynamics of the robot and use these motion primitives to build branches of the tree with RRT. Since every branch is built using the robot's motion primitives that doesn't lead to collision with obstacles, the resulting path is guaranteed to satisfy the robot's kinodynamic constraints and thus be feasible for navigation without any post-processing on the generated trajectory. We demonstrate the effectiveness of our approach in simulated 2D environments using simple robot models with a variety of motion primitives.

Learning for Robot Decision Making under Distribution Shift: A Survey

With the recent advances in the field of deep learning, learning-based methods are widely being implemented in various robotic systems that help robots understand their environment and make informed decisions to achieve a wide variety of tasks or goals. However, learning-based methods have repeatedly been shown to have poor generalization when they are presented with inputs that are different from those during training leading to the problem of distribution shift. Any robotic system that employs learning-based methods is prone to distribution shift which might lead the agents to make decisions that lead to degraded performance or even catastrophic failure. In this paper, we discuss various techniques that have been proposed in the literature to aid or improve decision making under distribution shift for robotic systems. We present a taxonomy of existing literature and present a survey of existing approaches in the area based on this taxonomy. Finally, we also identify a few open problems in the area that could serve as future directions for research.

Sophisticated Students in Boston Mechanism and Gale-Shapley Algorithm for School Choice Problem

We present our experimental results of simulating the school choice problem which deals with the assignment of students to schools based on each group's complete preference list for the other group using two algorithms: Boston mechanism and student-proposing Gale-Shapley algorithm. We compare the effects of sophisticated students altering their preference lists with regards to these two algorithms. Our simulation results show that sophisticated students can benefit more in Boston mechanism compared to Gale-Shapley algorithm based on multiple evaluation metrics.

Room Classification on Floor Plan Graphs using Graph Neural Networks

We present our approach to improve room classification task on floor plan maps of buildings by representing floor plans as undirected graphs and leveraging graph neural networks to predict the room categories. Rooms in the floor plans are represented as nodes in the graph with edges representing their adjacency in the map. We experiment with House-GAN dataset that consists of floor plan maps in vector format and train multilayer perceptron and graph neural networks. Our results show that graph neural networks, specifically GraphSAGE and Topology Adaptive GCN were able to achieve accuracy of 80% and 81% respectively outperforming baseline multilayer perceptron by more than 15% margin.