Please wait, while we are loading the content...
Please wait, while we are loading the content...
| Content Provider | Springer Nature Link |
|---|---|
| Author | Ramaswami, Hemant Shaw, Raj Shankar Anand, Sam |
| Copyright Year | 2010 |
| Abstract | Selection of the optimal set of cutting tools is one of the most important steps in process planning for 2.5-D pocket machining. Conventional CAM software requires considerable input from the user in terms of selection of tool sizes and machining strategy. This trial-and-error procedure to determine the optimal process sequence tends to generate conservative and suboptimal results. This paper presents a methodology for optimal selection of a sequence of tools to minimize the total time required to end mill a non-convex polygonal pocket with or without islands using the staircase milling strategy. The algorithm decomposes the pocket geometry into convex regions and mills each region independently by selecting a sequence of tools based on the accessibility of various tools to the region. Strategies have been developed for machining the main pass and the subsequent leftover areas in order to obtain the final pocket geometry. Subsequently, the machining times for each decomposed area are aggregated while accounting for the need to use multiple passes, non-cutting time, and the tool change time. A dynamic programming approach is used to determine the optimal set of tools which minimizes the total processing time. The effect of varying the non-cutting speed and tool change time on the tool path length and number of tool selection is studied. |
| Starting Page | 963 |
| Ending Page | 977 |
| Page Count | 15 |
| File Format | |
| ISSN | 02683768 |
| Journal | The International Journal of Advanced Manufacturing Technology |
| Volume Number | 53 |
| Issue Number | 9-12 |
| e-ISSN | 14333015 |
| Language | English |
| Publisher | Springer-Verlag |
| Publisher Date | 2010-09-14 |
| Publisher Place | London |
| Access Restriction | One Nation One Subscription (ONOS) |
| Subject Keyword | Pocket machining Dynamic programming Polygon decomposition Optimal tool set Machining process planning Mechanical Engineering Industrial and Production Engineering Production/Logistics Computer-Aided Engineering (CAD, CAE) and Design |
| Content Type | Text |
| Resource Type | Article |
| Subject | Industrial and Manufacturing Engineering Control and Systems Engineering Mechanical Engineering Computer Science Applications Software |
National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.
Learn more about this project from here.
NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.
Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.
| Sl. | Authority | Responsibilities | Communication Details |
|---|---|---|---|
| 1 | Ministry of Education (GoI), Department of Higher Education |
Sanctioning Authority | https://www.education.gov.in/ict-initiatives |
| 2 | Indian Institute of Technology Kharagpur | Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project | https://www.iitkgp.ac.in |
| 3 | National Digital Library of India Office, Indian Institute of Technology Kharagpur | The administrative and infrastructural headquarters of the project | Dr. B. Sutradhar bsutra@ndl.gov.in |
| 4 | Project PI / Joint PI | Principal Investigator and Joint Principal Investigators of the project |
Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon |
| 5 | Website/Portal (Helpdesk) | Queries regarding NDLI and its services | support@ndl.gov.in |
| 6 | Contents and Copyright Issues | Queries related to content curation and copyright issues | content@ndl.gov.in |
| 7 | National Digital Library of India Club (NDLI Club) | Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach | clubsupport@ndl.gov.in |
| 8 | Digital Preservation Centre (DPC) | Assistance with digitizing and archiving copyright-free printed books | dpc@ndl.gov.in |
| 9 | IDR Setup or Support | Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops | idr@ndl.gov.in |
|
Loading...
|